1184 search results - page 118 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
127
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper presents a hybrid evolutionary programming algorithm to solve the spread spectrum radar polyphase code design problem. The proposed algorithm uses an Evolutionary Progr...
159
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
120
click to vote
DATE
2002
IEEE
15 years 7 months ago
2002
IEEE
: A new technique is presented in this paper to improve the efficiency of data scheduling for multi-context reconfigurable architectures targeting multimedia and DSP applications. ...
127
Voted
ICAC
2006
IEEE
15 years 8 months ago
2006
IEEE
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
137
Voted
CDC
2009
IEEE
15 years 13 days ago
2009
IEEE
Recent results have suggested that online Model Predictive Control (MPC) can be computed quickly enough to control fast sampled systems. High-speed applications impose a hard real-...