638 search results - page 68 / 128 » A New Approach to Tractable Planning |
UAI
1996
14 years 11 months ago
1996
We propose a decision-analytical approach to comparing the flexibility of decision situations from the perspective of a decisionmaker who exhibits constant risk-aversion over a mo...
CP
2004
Springer
15 years 3 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
117
click to vote
CVPR
2012
IEEE
13 years 7 days ago
2012
IEEE
We present a new approach to matching graphs embedded in R2 or R3 . Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not req...
AIPS
2010
15 years 4 days ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
AAAI
2010
14 years 11 months ago
2010
We consider the stochastic variant of the Canadian Traveler's Problem, a path planning problem where adverse weather can cause some roads to be untraversable. The agent does ...