Sciweavers

155 search results - page 27 / 31
» A new heuristic algorithm for reversible logic synthesis
Sort
View
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 11 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
13 years 11 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
IEEESCC
2005
IEEE
14 years 1 months ago
Web Service Discovery Based on Behavior Signatures
Web service discovery is a key problem as the number of services is expected to increase dramatically. Service discovery at the present time is based primarily on keywords, or int...
Zhongnan Shen, Jianwen Su
ICCAD
2005
IEEE
87views Hardware» more  ICCAD 2005»
14 years 4 months ago
Statistical technology mapping for parametric yield
The increasing variability of process parameters leads to substantial parametric yield losses due to timing and leakage power constraints. Leakage power is especially affected by ...
Ashish Kumar Singh, Murari Mani, Michael Orshansky
GECCO
2007
Springer
276views Optimization» more  GECCO 2007»
14 years 1 months ago
Meta-optimizing semantic evolutionary search
I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution. Distributions are not esti...
Moshe Looks