1927 search results - page 18 / 386 » UMDAs for dynamic optimization problems |
108
click to vote
FLAIRS
2006
15 years 1 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
95
Voted
AMC
2006
15 years 16 days ago
2006
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and t...
128
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
TASE
2008
IEEE
15 years 11 days ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
89
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...