default search action
Annals of Mathematics and Artificial Intelligence, Volume 79
Volume 79, Numbers 1-3, March 2017
- Lisa Hellerstein, Lev Reyzin, György Turán:
Foreword. 1-3 - André Abramé, Djamal Habet, Donia Toumi:
Improving configuration checking for satisfiable random k-SAT instances. 5-24 - Balasim Al-Saedi, Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs:
About some UP-based polynomial fragments of SAT. 25-44 - Salem Benferhat, Zied Bouraoui, Odile Papini, Éric Würbel:
Prioritized assertional-based removed sets revision of DL-Lite belief bases. 45-75 - Natalia Flerova, Radu Marinescu, Rina Dechter:
Weighted heuristic anytime search: new schemes for optimization over graphical models. 77-128 - Dan Gutfreund, Aryeh Kontorovich, Ran Levy
, Michal Rosen-Zvi
Boosting conditional probability estimators. 129-144 - Utz-Uwe Haus, Carla Michini
Compact representations of all members of an independence system. 145-162 - Gabriele Kern-Isberner, Marco Wilhelm
Probabilistic knowledge representation using the principle of maximum entropy and Gröbner basis theory. 163-179 - Seishi Ouchi, Tomohiko Okayama, Keisuke Otaki, Ryo Yoshinaka
Learning concepts and their unions from positive data with refinement operators. 181-203 - Xia Qu, Prashant Doshi:
On the role of fairness and limited backward induction in sequential bargaining games - New behavioral models and analyses. 205-227 - Takahisa Toda
Dualization of boolean functions using ternary decision diagrams. 229-244 - Piotr Wojciechowski
Analyzing restricted fragments of the theory of linear arithmetic. 245-266
Volume 79, Number 4, April 2017
- Dimitris Magos, Ioannis Mourtos
Submodularity and its application to some global constraints. 267-289 - Tomás de la Rosa, Raquel Fuentetaja
Bagging strategies for learning planning policies. 291-305 - Jan Triska
Logic of temporal attribute implications. 307-335 - Mikko Lauri
Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering. 337-370 - Piotr Wojciechowski
Erratum to: Analyzing restricted fragments of the theory of linear arithmetic. 371-392
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: