![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Artificial Intelligence Research (JAIR), Volume 15
Volume 15, 2001
- Jun Hong:
Goal Recognition through Goal Graph Analysis. 1-30 - Jeffrey Mark Siskind
:
Grounding the Lexical Semantics of Verbs in Visual Perception using Force Dynamics and Event Logic. 31-90 - Chiranjib Bhattacharyya, S. Sathiya Keerthi:
Mean Field Methods for a Special Class of Belief Networks. 91-114 - Ioannis Refanidis, Ioannis P. Vlahavas:
The GRT Planning System: Backward Heuristic Construction in Forward State-Space Planning. 115-161 - Tapio Elomaa, Matti Kääriäinen:
An Analysis of Reduced Error Pruning. 163-187 - Peter Stone, Michael L. Littman, Satinder Singh, Michael J. Kearns:
ATTac-2000: An Adaptive Autonomous Bidding Agent. 189-206 - José Luis Ambite, Craig A. Knoblock:
Planning by Rewriting. 207-261 - Manuel Palomar
, Patricio Martínez-Barco:
Computational Approach to Anaphora Resolution in Spanish Dialogues. 263-287 - Jochen Renz, Bernhard Nebel:
Efficient Methods for Qualitative Spatial Reasoning. 289-318 - Jonathan Baxter, Peter L. Bartlett
:
Infinite-Horizon Policy-Gradient Estimation. 319-350 - Jonathan Baxter, Peter L. Bartlett, Lex Weaver:
Experiments with Infinite-Horizon, Policy-Gradient Estimation. 351-381 - Christopher Meek:
Finding a Path is Harder than Finding a Tree. 383-389 - Taisuke Sato
, Yoshitaka Kameya:
Parameter Learning of Logic Programs for Symbolic-Statistical Modeling. 391-454
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.