158 search results - page 10 / 32 » On Complexity of Optimal Recombination for Binary Representa... |
ICCD
2006
IEEE
14 years 4 months ago
2006
IEEE
—In-place flipping of rectangular blocks/cells can potentially reduce the wirelength of a floorplan/placement solution without changing the chip area, In a recent work [Hao 05], ...
TEC
2002
13 years 7 months ago
2002
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principl...
SIAMCOMP
2002
13 years 7 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...