Sciweavers

851 search results - page 40 / 171
» An exact algorithm for solving the vertex separator problem
Sort
View
DAC
1996
ACM
14 years 20 days ago
Espresso-HF: A Heuristic Hazard-Free Minimizer for Two-Level Logic
-- We present a new heuristic algorithm for hazard-free minimization of two-level logic. On nearly all examples, the algorithm finds an exactly minimum-cost cover. It also solves s...
Michael Theobald, Steven M. Nowick, Tao Wu
SIP
2003
13 years 10 months ago
Time Domain Optimization Techniques for Blind Separation of Non-stationary Convolutive Mixed Signals
This paper aims to solve the problem of Blind Signal Separation (BSS) in a convolutive environment based on output correlation matrix diagonalization. Firstly an extension of the ...
Iain Russell, Alfred Mertins, Jiangtao Xi
ATAL
2010
Springer
13 years 9 months ago
Enumeration and exact design of weighted voting games
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...
Bart de Keijzer, Tomas Klos, Yingqian Zhang
VMCAI
2007
Springer
14 years 2 months ago
Constraint Solving for Interpolation
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
Andrey Rybalchenko, Viorica Sofronie-Stokkermans
SIGGRAPH
1997
ACM
14 years 1 days ago
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
Frédo Durand, George Drettakis, Claude Puec...