Sciweavers

2042 search results - page 81 / 409
» Variable Number of
Sort
View
138
Voted
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 6 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
QUESTA
2008
82views more  QUESTA 2008»
15 years 3 months ago
Corrected asymptotics for a multi-server queue in the Halfin-Whitt regime
To obtain insight in the quality of heavy-traffic approximations for queues with many servers, we consider the steady-state number of waiting customers in an M/D/s queue as s . I...
Augustus J. E. M. Janssen, Johan van Leeuwaarden, ...
145
Voted
ATAL
2006
Springer
15 years 6 months ago
Logics of propositional control
The `Cooperation Logic of Propositional Control', cl-pc, of van der Hoek and Wooldridge is a logic for reasoning about the ability of agents and groups of agents to obtain a ...
Jelle Gerbrandy
SAT
2005
Springer
124views Hardware» more  SAT 2005»
15 years 9 months ago
An Improved Upper Bound for SAT
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
Evgeny Dantsin, Alexander Wolpert
JSAT
2006
119views more  JSAT 2006»
15 years 4 months ago
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. This algorithm uses the clauseshorte...
Evgeny Dantsin, Alexander Wolpert