Sciweavers

613 search results - page 5 / 123
» Some Observations on Holographic Algorithms
Sort
View
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
15 years 10 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
HYBRID
2010
Springer
15 years 4 months ago
Timed automata with observers under energy constraints
In this paper we study one-clock priced timed automata in which prices can grow linearly ( ˙p = k) or exponentially ( ˙p = kp), with discontinuous updates on edges. We propose E...
Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Ni...
AAAI
2008
14 years 12 months ago
Computing Observation Vectors for Max-Fault Min-Cardinality Diagnoses
Model-Based Diagnosis (MBD) typically focuses on diagnoses, minimal under some minimality criterion, e.g., the minimal-cardinality set of faulty components that explain an observa...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
15 years 3 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze
UAI
1998
14 years 11 months ago
Learning From What You Don't Observe
The process of diagnosis involves learning about the state of a system from various observations of symptoms or findings about the system. Sophisticated Bayesian (and other) algor...
Mark A. Peot, Ross D. Shachter