default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 314 matches
- 2010
- Muhammad Aurangzeb Ahmad, David A. Huffaker, Jing Wang, Jeffrey William Treem, Marshall Scott Poole, Jaideep Srivastava:
GTPA: A Generative Model For Online Mentor-Apprentice Networks. AAAI 2010: 1294-1299 - Alon Altman, Robert Kleinberg:
Nonmanipulable Randomized Tournament Selections. AAAI 2010: 686-690 - Christopher Amato, Blai Bonet, Shlomo Zilberstein:
Finite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs. AAAI 2010: 1052-1058 - Saeed Amizadeh, Milos Hauskrecht:
Latent Variable Model for Learning in Pairwise Markov Networks. AAAI 2010: 382-387 - Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
A New Algorithm for Weighted Partial MaxSAT. AAAI 2010: 3-8 - Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
Exploiting Monotonicity in Interval Constraint Propagation. AAAI 2010: 9-14 - Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev:
Past and Future of DL-Lite. AAAI 2010: 243-248 - Itai Ashlagi, Moshe Tennenholtz, Aviv Zohar:
Competing Schedulers. AAAI 2010: 691-696 - Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou:
Ordered Completion for First-Order Logic Programs on Finite Structures. AAAI 2010: 249-254 - Gilles Audemard, George Katsirelos, Laurent Simon:
A Restriction of Extended Resolution for Clause Learning SAT Solvers. AAAI 2010: 15-20 - Javad Azimi, Xiaoli Z. Fern, Alan Fern, Elizabeth Burrows, Frank Chaplen, Yanzhen Fan, Hong Liu, Jun Jaio, Rebecca Schaller:
Myopic Policies for Budgeted Optimization with Constrained Experiments. AAAI 2010: 388-393 - Yoram Bachrach, Nadja Betzler, Piotr Faliszewski:
Probabilistic Possible Winner Determination. AAAI 2010: 697-702 - Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet Kohli:
Coalitional Structure Generation in Skill Games. AAAI 2010: 703-708 - Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle:
Multi-Agent Plan Recognition: Formalization and Algorithms. AAAI 2010: 1059-1064 - Nicola Basilico, Nicola Gatti, Federico Villa:
Asynchronous Multi-Robot Patrolling against Intrusions in Arbitrary Topologies. AAAI 2010: 1224-1229 - Sumit Basu, Danyel Fisher, Steven Mark Drucker, Hao Lu:
Assisting Users with Clustering Tasks by Combining Metric Learning and Classification. AAAI 2010: 394-400 - Brent Beer, Ross Mead, Jerry B. Weinberg:
A Distributed Method for Evaluating Properties of a Robot Formation. AAAI 2010: 1923-1924 - Vaishak Belle, Gerhard Lakemeyer:
Reasoning about Imperfect Information Games in the Epistemic Situation Calculus. AAAI 2010: 255-260 - Russell Bent, Alan Berscheid, G. Loren Toole:
Transmission Network Expansion Planning with Simulation Optimization. AAAI 2010: 21-26 - Christian Bessiere, George Katsirelos, Nina Narodytska, Claude-Guy Quimper, Toby Walsh:
Propagating Conjunctions of AllDifferent Constraints. AAAI 2010: 27-32 - Sumit Bhatia, Prasenjit Mitra:
Adopting Inference Networks for Online Thread Retrieval. AAAI 2010: 1300-1305 - Subhrajit Bhattacharya:
Search-Based Path Planning with Homotopy Class Constraints. AAAI 2010: 1230-1237 - Meghyn Bienvenu, Hélène Fargier, Pierre Marquis:
Knowledge Compilation in the Modal Logic S5. AAAI 2010: 261-266 - Mustafa Bilgic, Lise Getoor:
Active Inference for Collective Classification. AAAI 2010: 1652-1655 - Blai Bonet, Héctor Palacios, Hector Geffner:
Automatic Derivation of Finite-State Machines for Behavior Control. AAAI 2010: 1656-1659 - Craig Boutilier, Kevin Regan, Paolo Viappiani:
Simultaneous Elicitation of Preference Features and Utility. AAAI 2010: 1160-1167 - Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Moshe Tennenholtz:
Transferable Utility Planning Games. AAAI 2010: 709-714 - Ronen I. Brafman, Yagil Engel:
Decomposed Utility Functions and Graphical Models for Reasoning about Preferences. AAAI 2010: 267-272 - Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra
:
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI 2010: 715-722 - Mickey Brautbar, Michael J. Kearns, Umar Syed:
Private and Third-Party Randomization in Risk-Sensitive Equilibrium Concepts. AAAI 2010: 723-728
skipping 284 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-08-17 13:35 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint