Sciweavers

2024 search results - page 292 / 405
» The cost of social agents
Sort
View
AAAI
2006
15 years 7 months ago
Prob-Maxn: Playing N-Player Games with Opponent Models
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
Nathan R. Sturtevant, Martin Zinkevich, Michael H....
UAI
2004
15 years 7 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown
AAAI
2000
15 years 7 months ago
Performance Comparison of Landmark Recognition Systems for Navigating Mobile Robots
Self-localisation is an essential competence for mobile robot navigation. Due to the fundamental unreliability of dead reckoning, a robot must depend on its perception of external...
Tom Duckett, Ulrich Nehmzow
AAAI
1998
15 years 7 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
AAAI
1994
15 years 7 months ago
Prediction Sharing Across Time and Contexts
Sometimes inferences made at some specific time are valid at other times, too. In model-based diagnosis and monitoring as well as qualitative simulation inferences are often re-do...
Oskar Dressler, Hartmut Freitag