Sciweavers

566 search results - page 94 / 114
» Artificial Intelligence for Adaptive Computer Games
Sort
View
AIPS
2006
14 years 11 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
CEC
2010
IEEE
14 years 10 months ago
A novel memetic algorithm for constrained optimization
In this paper, we present a memetic algorithm with novel local optimizer hybridization strategy for constrained optimization. The developed MA consists of multiple cycles. In each ...
Jianyong Sun, Jonathan M. Garibaldi
KI
2008
Springer
14 years 9 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson
IUI
2006
ACM
15 years 3 months ago
Fewer clicks and less frustration: reducing the cost of reaching the right folder
Helping computer users rapidly locate files in their folder hierarchies has become an important research topic in today’s intelligent user interface design. This paper reports o...
Xinlong Bao, Jonathan L. Herlocker, Thomas G. Diet...
CP
2003
Springer
15 years 2 months ago
Automated Mechanism Design: A New Application Area for Search Algorithms
Mechanism design is the art of designing the rules of the game (aka. mechanism) so that a desirable outcome (according to a given objective) is reached despite the fact that each a...
Tuomas Sandholm