Sciweavers

486 search results - page 16 / 98
» Improved upper bounds for 3-SAT
Sort
View
USS
2008
13 years 10 months ago
Security Benchmarking using Partial Verification
Implementation-level vulnerabilities are a persistent threat to the security of computing systems. We propose using the results of partially-successful verification attempts to pl...
Thomas E. Hart, Marsha Chechik, David Lie
ICC
2009
IEEE
120views Communications» more  ICC 2009»
13 years 6 months ago
Achieving Exponential Diversity in Wireless Multihop Systems with Regenerative Relays
Abstract--We present and analyze two different power allocation strategies for considerably improving the average bit error rate (BER) performance of wireless multihop systems with...
Andreas Müller 0001, Joachim Speidel
LICS
2009
IEEE
14 years 3 months ago
An Improved Lower Bound for the Complementation of Rabin Automata
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
Yang Cai, Ting Zhang, Haifeng Luo
MFCS
2009
Springer
14 years 1 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
COCOA
2009
Springer
14 years 3 months ago
Improved Bounds for Facility Location Games with Fair Cost Allocation
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
Thomas Dueholm Hansen, Orestis Telelis