Sciweavers

360 search results - page 43 / 72
» The TV-Break Packing Problem
Sort
View
IPL
2007
105views more  IPL 2007»
14 years 9 months ago
Approximability of identifying codes and locating-dominating codes
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
Jukka Suomela
SAMOS
2004
Springer
15 years 3 months ago
Scalable Instruction-Level Parallelism.
This paper presents a model for instruction-level distributed computing that allows the implementation of scalable chip multiprocessors. Based on explicit microthreading it serves ...
Chris R. Jesshope
DAGSTUHL
2006
14 years 11 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 9 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
68
Voted
ASPDAC
2005
ACM
119views Hardware» more  ASPDAC 2005»
14 years 11 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...