1927 search results - page 122 / 386 » UMDAs for dynamic optimization problems |
130
click to vote
PERCOM
2007
ACM
16 years 3 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
143
click to vote
CIMAGING
2009
15 years 4 months ago
2009
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
129
Voted
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— We recast the problem of unconstrained continuous evolutionary optimization as inference in a fixed graphical model. This approach allows us to address several pervasi...
114
Voted
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
In recent years dynamic optimization problems have attracted a growing interest from the community of genetic algorithms with several approaches developed to address these problems...
101
Voted
ICIAR
2004
Springer
15 years 9 months ago
2004
Springer
Finding contours in constrained search space is a well known problem. It is encountered in such areas as tracking objects in videos, or finding objects within defined boundaries....