Sciweavers

5630 search results - page 907 / 1126
» Computability in Specification
Sort
View
AIPS
2010
15 years 9 months ago
Classical Planning in MDP Heuristics: with a Little Help from Generalization
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
Andrey Kolobov, Mausam, Daniel S. Weld
ATAL
2008
Springer
15 years 8 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
EUMAS
2006
15 years 8 months ago
A Customizable Multi-Agent System for Distributed Data Mining
We present a general Multi-Agent System framework for distributed data mining based on a Peer-toPeer model. The framework adopts message-based asynchronous communication and a dyn...
Giancarlo Fortino, Giuseppe Di Fatta
ATAL
2010
Springer
15 years 7 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
SI3D
2010
ACM
15 years 6 months ago
Efficient irradiance normal mapping
Irradiance normal mapping is a method to combine two popular techniques, light mapping and normal mapping, and is used in games such as Half-Life 2 or Halo 3. This combination all...
Ralf Habel, Michael Wimmer