Sciweavers

1542 search results - page 84 / 309
» Kernelization of packing problems
Sort
View
DAGSTUHL
2006
15 years 1 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
EC
2008
153views ECommerce» more  EC 2008»
14 years 11 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
EUROSYS
2007
ACM
15 years 9 months ago
Dynamic and adaptive updates of non-quiescent subsystems in commodity operating system kernels
Continuously running systems require kernel software updates applied to them without downtime. Facilitating fast reboots, or delaying an update may not be a suitable solution in m...
Kristis Makris, Kyung Dong Ryu
ASPDAC
2005
ACM
119views Hardware» more  ASPDAC 2005»
15 years 1 months ago
CMP aware shuttle mask floorplanning
- By putting different chips on the same mask, shuttle mask (or multiple project wafer) provides an economical solution for low volume designs and design prototypes to share the ri...
Gang Xu, Ruiqi Tian, David Z. Pan, Martin D. F. Wo...
ACID
2006
236views Algorithms» more  ACID 2006»
15 years 1 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....