Sciweavers

808 search results - page 106 / 162
» A scaling algorithm for polynomial constraint satisfaction p...
Sort
View
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
15 years 10 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
EVOW
2010
Springer
15 years 10 months ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu
FMCAD
2009
Springer
16 years 13 days ago
Scaling VLSI design debugging with interpolation
—Given an erroneous design, functional verification returns an error trace exhibiting a mismatch between the specification and the implementation of a design. Automated design ...
Brian Keng, Andreas G. Veneris
ISQED
2002
IEEE
111views Hardware» more  ISQED 2002»
15 years 10 months ago
Optimization of the Power/Ground Network Wire-Sizing and Spacing Based on Sequential Network Simplex Algorithm
This paper presents a fast algorithm to optimize both the widths and lengths of power/ground networks under reliability and power dip/ground bounce constraints. The spacesizing wh...
Ting-Yuan Wang, Charlie Chung-Ping Chen
ICALP
2009
Springer
16 years 19 days ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...