Sciweavers

91 search results - page 17 / 19
» Dynamics of local search heuristics for the traveling salesm...
Sort
View
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 8 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
EDBT
2008
ACM
85views Database» more  EDBT 2008»
14 years 7 months ago
Optimizing on-demand data broadcast scheduling in pervasive environments
Data dissemination in pervasive environments is often accomplished by on-demand broadcasting. The time critical nature of the data requests plays an important role in scheduling t...
Rinku Dewri, Indrakshi Ray, Indrajit Ray, Darrell ...
CP
2006
Springer
13 years 11 months ago
Adaptive Clause Weight Redistribution
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abd...
IAT
2005
IEEE
14 years 1 months ago
Dynamic Lightpath Protection in WDM optical Networks Using Ant-based Mobile Agents
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi