Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Artificial Intelligence Research, Volume 42
Volume 42, September 2011
- Toby Walsh:
Where Are the Hard Manipulation Problems? 1-29 - Richard Booth, Thomas Andreas Meyer
, Ivan José Varzinczak, Renata Wassermann:
On the Link between Partial Meet, Kernel, and Infra Contraction and its Application to Horn Logic. 31-53 - Ko-Hsin Cindy Wang, Adi Botea:
MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees. 55-90 - Richard Hoshino, Ken-ichi Kawarabayashi:
Scheduling Bipartite Tournaments to Minimize Total Travel Distance. 91-124 - Joohyung Lee, Yunsong Meng:
First-Order Stable Model Semantics and First-Order Loop Formulas. 125-180 - Peng Dai, Mausam, Daniel S. Weld, Judy Goldsmith:
Topological Value Iteration Algorithms. 181-209 - Ganesh Ram Santhanam, Samik Basu, Vasant G. Honavar:
Representing and Reasoning with Qualitative Preferences for Compositional Systems. 211-274 - Ricardo Ribeiro, David Martins de Matos:
Centrality-as-Relevance: Support Sets and Similarity as Geometric Proximity. 275-308 - Changhe Yuan, Heejin Lim, Tsai-Ching Lu:
Most Relevant Explanation in Bayesian Networks. 309-352 - Erik Talvitie, Satinder Singh:
Learning to Make Predictions In Partially Observable Environments Without a Generative Model. 353-392 - Peter D. Grünwald, Joseph Y. Halpern:
Making Decisions Using Sets of Probabilities: Updating, Time Consistency, and Calibration. 393-426 - Daniel Golovin, Andreas Krause:
Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization. 427-486 - Mario Alviano, Francesco Calimeri, Wolfgang Faber, Nicola Leone, Simona Perri:
Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates. 487-527 - Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Cloning in Elections: Finding the Possible Winners. 529-573 - Marc J. V. Ponsen, Steven de Jong, Marc Lanctot:
Computing Approximate Nash Equilibria and Robust Best-Responses Using Sampling. 575-605 - Patrick R. Conrad, Brian Charles Williams:
Drake: An Efficient Executive for Temporal Plans with Choice. 607-659 - José M. Peña:
Finding Consensus Bayesian Network Structures. 661-687 - Enrique Amigó, Julio Gonzalo, Javier Artiles, Felisa Verdejo:
Combining Evaluation Metrics via the Unanimous Improvement Ratio and its Application to Clustering Tasks. 689-718 - Piero A. Bonatti, Marco Faella, Luigi Sauro:
Defeasible Inclusions in Low-Complexity DLs. 719-764 - Perukrishnen Vytelingum, Thomas Voice, Sarvapali D. Ramchurn, Alex Rogers, Nicholas R. Jennings:
Theoretical and Practical Foundations of Large-Scale Agent-Based Micro-Storage in the Smart Grid. 765-813 - Jia-Hong Wu, Rajesh Kalyanam, Robert Givan:
Stochastic Enforced Hill-Climbing. 815-850 - Matthew L. Ginsberg:
Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs. 851-886 - Noa Agmon, Gal A. Kaminka, Sarit Kraus:
Multi-Robot Adversarial Patrolling: Facing a Full-Knowledge Opponent. 887-916 - Dov M. Gabbay, David Pearce, Agustín Valverde:
Interpolable Formulas in Equilibrium Logic and Answer Set Programming. 917-943
a service of 
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-06-07 19:53 CEST 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:
