Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Artificial Intelligence Research (JAIR), Volume 21
Volume 21, 2004
- Nevin Lianwen Zhang, Tomás Kocka:
Effective Dimensions of Hierarchical Latent Class Models. 1-17 - Michael P. Wellman, Daniel M. Reeves, Kevin M. Lochner, Yevgeniy Vorobeychik:
Price Prediction in a Trading Agent Competition. 19-36 - Dov Monderer, Moshe Tennenholtz:
K-Implementation. 37-62 - Kenneth O. Stanley, Risto Miikkulainen:
Competitive Coevolution through Evolutionary Complexification. 63-100 - James D. Park, Adnan Darwiche:
Complexity Results and Approximation Strategies for MAP Explanations. 101-133 - Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, David Poole:
CP-nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements. 135-191 - Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes:
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work. 193-243 - Ofer Arieli, Marc Denecker
, Bert Van Nuffelen, Maurice Bruynooghe:
Coherent Integration of Databases by Abductive Logic Programming. 245-286 - Mark-Jan Nederhof, Giorgio Satta:
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. 287-317 - Joseph Y. Halpern, Daphne Koller:
Representation Dependence in Probabilistic Inference. 319-356 - Brahim Hnich, Toby Walsh, Barbara M. Smith:
Dual Modelling of Permutation and Injection Problems. 357-391 - Cynthia A. Thompson, Mehmet H. Göker, Pat Langley:
A Personalized System for Conversational Recommendations. 393-428 - Peter Gorniak, Deb Roy:
Grounded Semantic Composition for Visual Scenes. 429-470 - Weixiong Zhang:
Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem. 471-497 - Jeroen Keppens, Qiang Shen:
Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences. 499-550 - Paolo Liberatore:
On Polynomial Sized MDP Succinct Policies. 551-577 - Allan Borodin, Ran El-Yaniv, Vincent Gogan:
Can We Learn to Beat the Best Stock. 579-594 - Moshe Babaioff, Noam Nisan:
Concurrent Auctions Across The Supply Chain. 595-629 - Ariel Felner, Roni Stern, Sarit Kraus, Asaph Ben-Yair, Nathan S. Netanyahu:
PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment. 631-670
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-04-22 20:02 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:
