Sciweavers

96 search results - page 16 / 20
» Espresso-Signature: A New Exact Minimizer for Logic Function...
Sort
View
117
Voted
TCAD
1998
125views more  TCAD 1998»
15 years 1 months ago
BDD-based synthesis of extended burst-mode controllers
Abstract—We examine the implications of a new hazard-free combinational logic synthesis method [1], which generates multiplexor-based networks from binary decision diagrams (BDDs...
Kenneth Y. Yun, Bill Lin, David L. Dill, Srinivas ...
CVPR
2010
IEEE
15 years 10 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
AAAI
2008
15 years 4 months ago
Efficiently Exploiting Dependencies in Local Search for SAT
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...
Duc Nghia Pham, John Thornton, Abdul Sattar
PE
2011
Springer
365views Optimization» more  PE 2011»
14 years 9 months ago
Optimal resource allocation for time-reservation systems
This paper studies the optimal resource allocation in time-reservation systems. Customers arrive at a service facility and receive service in two steps; in the first step informa...
Ran Yang, Sandjai Bhulai, Rob van der Mei, Frank J...
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 5 months ago
Near-Entropy Hotlink Assignments
Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by ...
Karim Douïeb, Stefan Langerman