126 search results - page 3 / 26 » Optimal Delay-Constrained Minimum Cost Loop Algorithm for Lo... |
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
EVOW
2001
Springer
13 years 10 months ago
2001
Springer
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
ASPLOS
1994
ACM
13 years 10 months ago
1994
ACM
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
MOBICOM
2006
ACM
13 years 12 months ago
2006
ACM
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
PPOPP
2005
ACM
13 years 11 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...