Sciweavers

246 search results - page 32 / 50
» Compactly generated domain theory
Sort
View
AI
2010
Springer
14 years 12 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
81
Voted
ECCV
2002
Springer
16 years 1 months ago
Time-Recursive Velocity-Adapted Spatio-Temporal Scale-Space Filters
Abstract. This paper presents a theory for constructing and computing velocity-adapted scale-space filters for spatio-temporal image data. Starting from basic criteria in terms of ...
Tony Lindeberg
ATAL
2008
Springer
15 years 1 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
ATAL
2011
Springer
13 years 11 months ago
Solving Stackelberg games with uncertain observability
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
KER
2007
90views more  KER 2007»
14 years 11 months ago
PLTOOL: A knowledge engineering tool for planning and learning
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
Susana Fernández, Daniel Borrajo, Raquel Fu...