566 search results - page 59 / 114 » Artificial Intelligence for Adaptive Computer Games |
114
Voted
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In concrete environments, where uncertainty and dynamism are pervasive and time and resources are limited, reasoning and decision-making processes raise important problem...
125
Voted
AMAI
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
109
Voted
ECAI
1992
Springer
15 years 7 months ago
1992
Springer
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
132
Voted
TSP
2010
14 years 10 months ago
2010
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
134
Voted
SARA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...