3433 search results - page 370 / 687 » Heuristics for a bidding problem |
170
Voted
AAAI
1997
15 years 8 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
190
click to vote
ECAI
2010
Springer
15 years 8 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
164
click to vote
AUTOMATICA
2008
15 years 7 months ago
2008
This paper studies a general dynamic buffer management problem with one buffer inserted between two interacting components. The component to be controlled is assumed to have multi...
219
Voted
JAIR
2008
15 years 6 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
240
click to vote
ADAC
2008
15 years 7 months ago
2008
We consider the problem of multiple fitting of linearly parametrized curves, that arises in many computer vision problems such as road scene analysis. Data extracted from images us...