4894 search results - page 236 / 979 » Dynamic Abstraction Planning |
160
click to vote
ACSD
2006
IEEE
15 years 10 months ago
2006
IEEE
Dynamic communication systems (DCS) are complex because of their unboundedness in several dimensions. They have an unbounded and changing number of objects, a dynamically changing...
148
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
169
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— This paper addresses a problem of finding an optimal dynamic quantizer for nonlinear control subject to discretevalued signal constraints. The quantizers to be studied...
189
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract- This paper presents an approach of using Differential Evolution (DE) to solve dynamic optimization problems. Careful setting of parameters is necessary for DE algorithms ...
177
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
d Abstract) Bertrand Ducourthial Sofiane Khalfallah Franck Petit We propose a group membership service for asynchronous wireless dynamic ad hoc networks. It maintains as long as p...