default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Artificial Intelligence Research, Volume 50
Volume 50, May 2014
- Min Zhang, Xinyan Xiao, Deyi Xiong
, Qun Liu:
Topic-Based Dissimilarity and Sensitivity Models for Translation Rule Selection. 1-30 - Yisong Wang, Yan Zhang, Yi Zhou, Mingyi Zhang:
Knowledge Forgetting in Answer Set Programming. 31-70 - Alan Fern, Sriraam Natarajan, Kshitij Judah, Prasad Tadepalli:
A Decision-Theoretic Model of Assistance. 71-104 - Bart de Keijzer, Tomas B. Klos, Yingqian Zhang:
Finding Optimal Solutions for Voting Game Design Problems. 105-140 - Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer:
Enhanced Partial Expansion A. 141-187 - Jasper De Bock, Gert de Cooman:
An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models. 189-233 - Nicolas Rivera, Leon Illanes, Jorge A. Baier, Carlos Hernández:
Reconnection with the Ideal Tree: A New Approach to Real-Time Search. 235-264 - Martin Suda:
Property Directed Reachability for Automated Planning. 265-319 - Francesco Maria Delle Fave, Albert Xin Jiang, Zhengyu Yin, Chao Zhang, Milind Tambe, Sarit Kraus, John P. Sullivan:
Game-Theoretic Patrolling with Dynamic Execution Uncertainty and a Case Study on a Real Transit System. 321-367 - Janardhan Rao Doppa, Alan Fern, Prasad Tadepalli:
HC-Search: A Learning Framework for Search-based Structured Prediction. 369-407 - Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. 409-446 - Martin C. Cooper, Frederic Maris, Pierre Régnier:
Monotone Temporal Planning: Tractability, Extensions and Applications. 447-485 - Emil Ragip Keyder, Jörg Hoffmann, Patrik Haslum:
Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions. 487-533 - Daria Terekhov, Tony T. Tran, Douglas G. Down, J. Christopher Beck:
Integrating Queueing Theory and Scheduling for Dynamic Scheduling Problems. 535-572 - Anja Rey, Jörg Rothe:
False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time. 573-601 - Denis Deratani Mauá, Cassio P. de Campos, Alessio Benavoli, Alessandro Antonucci:
Probabilistic Inference in Credal Networks: New Complexity Results. 603-637 - Alfonso Gerevini, Alessandro Saetti, Mauro Vallati:
Planning through Automatic Portfolio Configuration: The PbP Approach. 639-696 - David Bergman, André A. Ciré, Willem Jan van Hoeve:
MDD Propagation for Sequence Constraints. 697-722 - Svetlana Kiritchenko, Xiaodan Zhu, Saif M. Mohammad:
Sentiment Analysis of Short Informal Texts. 723-762 - André da Motta Salles Barreto, Joelle Pineau, Doina Precup:
Policy Iteration Based on Stochastic Factorization. 763-803 - Uthayasanker Thayasivam, Prashant Doshi:
Speeding Up Iterative Ontology Alignment using Block-Coordinate Descent. 805-845 - Yair Zick, Evangelos Markakis, Edith Elkind:
Arbitration and Stability in Cooperative Games with Overlapping Coalitions. 847-884 - Andreas Veit, Ying Xu, Ronghuo Zheng, Nilanjan Chakraborty, Katia P. Sycara:
Demand Side Energy Management via Multiagent Coordination in Consumer Cooperatives. 885-922 - Blai Bonet, Hector Geffner:
Belief Tracking for Planning with Sensing: Width, Complexity and Approximations. 923-970
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-11-19 20:34 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:
