10051 search results - page 436 / 2011 » A Dynamic Separator Algorithm |
169
click to vote
IPPS
2005
IEEE
16 years 1 months ago
2005
IEEE
On-line routing strategies for communication in a dynamic network on chip (DyNoC) environment are presented. The DyNoC has been presented as a medium supporting communication amon...
190
click to vote
GECCO
2005
Springer
16 years 1 months ago
2005
Springer
Cooperative co-evolution is often used to solve difficult optimization problems by means of problem decomposition. Its performance for such tasks can vary widely from good to disa...
184
click to vote
ICALP
2005
Springer
16 years 1 months ago
2005
Springer
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
190
click to vote
ICOIN
2005
Springer
16 years 1 months ago
2005
Springer
This paper proposes a rerouting scheme that can be applied to the restoration of working Label Switched Paths (LSPs) and preprovisioned backup LSPs, which consists of two subsequen...
218
click to vote
GECCO
2004
Springer
16 years 29 days ago
2004
Springer
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...