10568 search results - page 715 / 2114 » Computer Intelligence and Formalization |
212
Voted
AAAI
2004
15 years 8 months ago
2004
This paper presents a discussion of the theoretical complexity of plan recognition on the basis of an analysis of the number of explanations that any complete plan recognition alg...
156
Voted
AAAI
2004
15 years 8 months ago
2004
We present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2player games and one for n-player games. We test these algorithms on m...
167
click to vote
AAAI
1997
15 years 8 months ago
1997
We present a theory of qualitative rigid body mechanics and describe a program that uses this theory to compute qualitative dynamic simulations.1 The program works directly from a...
188
Voted
AAAI
1994
15 years 8 months ago
1994
We propose a propositional language for temporal reasoning that is computationally effective yet expressive enough to describe information about fluents, events and temporal const...
188
click to vote
AI
2008
Springer
15 years 7 months ago
2008
Springer
Stochastic local search (SLS) algorithms have recently been proven to be among the best approaches to solving computationally hard problems. SLS algorithms typically have a number...