Sciweavers

472 search results - page 55 / 95
» Limiting Negations in Formulas
Sort
View
AAAI
2010
13 years 10 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher
TON
2002
75views more  TON 2002»
13 years 10 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
13 years 8 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
CADE
2005
Springer
14 years 10 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison
INFOCOM
2008
IEEE
14 years 4 months ago
Globally Optimal Channel Assignment for Non-Cooperative Wireless Networks
—Channel assignment is a very important topic in wireless networks. In this paper, we study FDMA channel assignment in a non-cooperative wireless network, where devices are selï¬...
Fan Wu, Sheng Zhong, Chunming Qiao