Sciweavers

3352 search results - page 358 / 671
» Hierarchical Problem Solving and the Bayesian Optimization A...
Sort
View
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
16 years 2 days ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher
DATE
2000
IEEE
85views Hardware» more  DATE 2000»
15 years 11 months ago
Meeting Delay Constraints in DSM by Minimal Repeater Insertion
We address the problem of inserting repeaters, selected from a library, at feasible locations in a placed and routed network to meet user-specified delay constraints. We use mini...
I-Min Liu, Adnan Aziz, D. F. Wong
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
15 years 11 months ago
Test scheduling for core-based systems
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
Krishnendu Chakrabarty
STACS
2004
Springer
15 years 12 months ago
An Algorithmic View on OVSF Code Assignment
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
Thomas Erlebach, Riko Jacob, Matús Mihal&aa...
TPDS
1998
92views more  TPDS 1998»
15 years 6 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu