Sciweavers

265 search results - page 39 / 53
» Neighborhood Composition: A Parallelization of Local Search ...
Sort
View
CIKM
2001
Springer
13 years 12 months ago
Joint Optimization of Cost and Coverage of Query Plans in Data Integration
Existing approaches for optimizing queries in data integration use decoupled strategies–attempting to optimize coverage and cost in two separate phases. Since sources tend to ha...
Zaiqing Nie, Subbarao Kambhampati
WSC
2008
13 years 9 months ago
The improved sweep metaheuristic for simulation optimization and application to job shop scheduling
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
George Jiri Mejtsky
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 1 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
DIALM
1999
ACM
127views Algorithms» more  DIALM 1999»
13 years 11 months ago
The performance of query control schemes for the zone routing protocol
—In this paper, we study the performance of route query control mechanisms for the Zone Routing Protocol (ZRP) for ad hoc networks. ZRP proactively maintains routing information ...
Zygmunt J. Haas, Marc R. Pearlman
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