Sciweavers

1547 search results - page 30 / 310
» Randomized Variable Elimination
Sort
View
117
Voted
SAT
2009
Springer
119views Hardware» more  SAT 2009»
15 years 9 months ago
Boundary Points and Resolution
We use the notion of boundary points to study resolution proofs. Given a CNF formula F, a lit(x)-boundary point is a complete assignment falsifying only clauses of F having the sam...
Eugene Goldberg
DAC
2010
ACM
15 years 6 months ago
An AIG-Based QBF-solver using SAT for preprocessing
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
Florian Pigorsch, Christoph Scholl
TELETRAFFIC
2007
Springer
15 years 8 months ago
Is ALOHA Causing Power Law Delays?
Abstract. Renewed interest in ALOHA-based Medium Access Control (MAC) protocols stems from their proposed applications to wireless ad hoc and sensor networks that require distribut...
Predrag R. Jelenkovic, Jian Tan
NIPS
2004
15 years 3 months ago
Exponential Family Harmoniums with an Application to Information Retrieval
Directed graphical models with one layer of observed random variables and one or more layers of hidden random variables have been the dominant modelling paradigm in many research ...
Max Welling, Michal Rosen-Zvi, Geoffrey E. Hinton
ICC
2007
IEEE
15 years 8 months ago
LOOFA-PB: A Modified LOOFA Scheduler for Variable-Length Packet Switching
—The LOOFA algorithm is a cell-based scheduler for CIOQ crossbar switches that can guarantee the work-conserving property in a cell-based switch if the crossbar switch works twic...
Afshin Shiravi, Paul S. Min