Sciweavers

247 search results - page 5 / 50
» Combining Adaptive and Dynamic Local Search for Satisfiabili...
Sort
View
KR
2004
Springer
14 years 25 days ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
EVOW
2008
Springer
13 years 9 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...
FLAIRS
2004
13 years 9 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
USENIX
2008
13 years 9 months ago
Adaptive File Transfers for Diverse Environments
This paper presents dsync, a file transfer system that can dynamically adapt to a wide variety of environments. While many transfer systems work well in their specialized context,...
Himabindu Pucha, Michael Kaminsky, David G. Anders...
JSAT
2008
99views more  JSAT 2008»
13 years 7 months ago
A Switching Criterion for Intensification and Diversification in Local Search for SAT
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
Wanxia Wei, Chu Min Li, Harry Zhang