539 search results - page 91 / 108 » An Improved Upper Bound for SAT |
EMSOFT
2007
Springer
14 years 3 months ago
2007
Springer
E-FRP is declarative language for programming resourcebounded, event-driven systems. The original high-level semantics of E-FRP requires that each event handler execute atomically...
CGO
2006
IEEE
14 years 3 months ago
2006
IEEE
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...