539 search results - page 30 / 108 » An Improved Upper Bound for SAT |
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
TABLEAUX
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
CIAC
2010
Springer
13 years 11 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...