Sciweavers

1559 search results - page 27 / 312
» Heuristic Approaches to Energy-Efficient Network Design Prob...
Sort
View
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
14 years 11 months ago
Computing minimum cuts by randomized search heuristics
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...
Frank Neumann, Joachim Reichel, Martin Skutella
CN
2006
85views more  CN 2006»
14 years 10 months ago
An efficient heuristic for selecting active nodes in wireless sensor networks
Energy saving is a paramount concern in wireless sensor networks (WSNs). A strategy for energy saving is to cleverly manage the duty cycle of sensors, by dynamically activating di...
Flávia Coimbra Delicato, Fábio Prott...
ANCS
2008
ACM
15 years 19 days ago
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
Yunyue Lin, Qishi Wu
CP
2000
Springer
15 years 3 months ago
New Search Heuristics for Max-CSP
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
Kalev Kask
CORR
2008
Springer
153views Education» more  CORR 2008»
14 years 10 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...