1184 search results - page 8 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
PPSN
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
129
click to vote
CODES
2004
IEEE
15 years 1 months ago
2004
IEEE
The memory subsystem accounts for a significant portion of the aggregate energy budget of contemporary embedded systems. Moreover, there exists a large potential for optimizing th...
PPOPP
2006
ACM
15 years 3 months ago
2006
ACM
Large-scale simulations and computational modeling using molecular dynamics (MD) continues to make significant impacts in the field of biology. It is well known that simulations...
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper presents an adaptation of a novel algorithm based on the foraging behavior of honey bees to solve constrained numerical optimization problems. The modifications focus on...
EVOW
2007
Springer
15 years 3 months ago
2007
Springer
In recent years, there has been an increasing concern from the evolutionary computation community on dynamic optimization problems since many real-world optimization problems are t...