Sciweavers

19010 search results - page 3490 / 3802
» Adapting to adaptive testing
Sort
View
CADE
2007
Springer
16 years 7 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 7 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
OSDI
2008
ACM
16 years 7 months ago
Redline: First Class Support for Interactivity in Commodity Operating Systems
While modern workloads are increasingly interactive and resource-intensive (e.g., graphical user interfaces, browsers, and multimedia players), current operating systems have not ...
Ting Yang, Tongping Liu, Emery D. Berger, Scott F....
« Prev « First page 3490 / 3802 Last » Next »