698 search results - page 49 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
ICTAI
2000
IEEE
14 years 25 days ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
Dealing with imprecise information is a common characteristic in real-world problems. Specifically, when the source of the information are physical sensors, a level of noise in t...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
This paper deals with the adaptive variance scaling issue in continuous Estimation of Distribution Algorithms. A phenomenon is discovered that current adaptive variance scaling me...
ENDM
2006
13 years 9 months ago
2006
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
EVOW
2009
Springer
14 years 4 months ago
2009
Springer
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...