Sciweavers

1830 search results - page 309 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
IPPS
2000
IEEE
15 years 2 months ago
Parallel Computation for Chromosome Reconstruction on a Cluster of Workstations
Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is...
Suchendra M. Bhandarkar, Salem Machaka, Sanjay She...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
15 years 10 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
IOR
2007
106views more  IOR 2007»
14 years 9 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
GLOBECOM
2006
IEEE
15 years 3 months ago
Bounds on the Lifetime of Wireless Sensor Networks Employing Multiple Data Sinks
Abstract—Employing multiple base stations is an attractive approach to enhance the lifetime of wireless sensor networks. In this paper, we address the fundamental question concer...
Amar P. Azad, Ananthanarayanan Chockalingam
GECCO
2003
Springer
109views Optimization» more  GECCO 2003»
15 years 3 months ago
Real Royal Road Functions for Constant Population Size
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...
Tobias Storch, Ingo Wegener