Sciweavers

238 search results - page 47 / 48
» Parallel Ant Colonies for Combinatorial Optimization Problem...
Sort
View
DM
2010
96views more  DM 2010»
13 years 7 months ago
On well-rounded sublattices of the hexagonal lattice
Abstract. We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameteriz...
Lenny Fukshansky, Daniel Moore, R. Andrew Ohana, W...
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 years 7 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
IPPS
2005
IEEE
14 years 1 months ago
FROST: Revisited and Distributed
FROST (Fold Recognition-Oriented Search Tool) [6] is a software whose purpose is to assign a 3D structure to a protein sequence. It is based on a series of filters and uses a dat...
Vincent Poirriez, Rumen Andonov, Antoine Marin, Je...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 1 months ago
Isolating the benefits of respect
The three mechanisms of crossover are transmission, assortment, and respect. Of these three mechanisms, assortment (i.e. recombination) is traditionally viewed as the primary feat...
Stephen Chen, Gregory Pitt
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
13 years 11 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger