Sciweavers

427 search results - page 75 / 86
» A Subexponential Bound for Linear Programming
Sort
View
MICAI
2005
Springer
14 years 2 months ago
Directed Cycles in Bayesian Belief Networks: Probabilistic Semantics and Consistency Checking Complexity
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
Alexander L. Tulupyev, Sergey I. Nikolenko
VLSID
1999
IEEE
88views VLSI» more  VLSID 1999»
14 years 1 months ago
New and Exact Filling Algorithms for Layout Density Control
To reduce manufacturing variation due to chemicalmechanical polishing and to improve yield, layout must be made uniform with respect to density criteria. This is achieved by layou...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Alex...
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
14 years 27 days ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
14 years 17 days ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
ATS
2005
IEEE
164views Hardware» more  ATS 2005»
13 years 10 months ago
A Family of Logical Fault Models for Reversible Circuits
Reversibility is of interest in achieving extremely low power dissipation; it is also an inherent design requirement of quantum computation. Logical fault models for conventional ...
Ilia Polian, Thomas Fiehn, Bernd Becker, John P. H...