1184 search results - page 33 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
ISCI
2010
14 years 8 months ago
2010
In this work a new optimization method, called the heuristic Kalman algorithm (HKA), is presented. This new algorithm is proposed as an alternative approach for solving continuous,...
ISSAC
2007
Springer
15 years 3 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
103
Voted
IJCAI
2007
14 years 11 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
60
Voted
ICIAR
2004
Springer
15 years 2 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....
91
Voted
TOG
2008
14 years 9 months ago
2008
Simulated characters in simulated worlds require simulated skills. We develop control strategies that enable physically-simulated characters to dynamically navigate environments w...