Sciweavers

1562 search results - page 246 / 313
» Convenience Over Correctness
Sort
View
NFM
2011
242views Formal Methods» more  NFM 2011»
14 years 4 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
ACTA
2011
14 years 4 months ago
Nonatomic dual bakery algorithm with bounded tokens
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
Alex A. Aravind, Wim H. Hesselink
JMLR
2010
148views more  JMLR 2010»
14 years 4 months ago
Approximate Inference on Planar Graphs using Loop Calculus and Belief Propagation
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
Vicenç Gómez, Hilbert J. Kappen, Mic...
REALWSN
2010
14 years 4 months ago
Visibility Levels: Managing the Tradeoff between Visibility and Resource Consumption
Pre-deployment tests of sensor networks in indoor testbeds can only deliver a very approximate view of the correctness and performance of a deployed sensor network and it is theref...
Junyan Ma, Kay Römer
TCSV
2010
14 years 4 months ago
Perceptually Unequal Packet Loss Protection by Weighting Saliency and Error Propagation
We describe a method for achieving perceptually minimal video distortion over packet-erasure networks using perceptually unequal loss protection (PULP). There are two main ingredie...
Hojin Ha, Jincheol Park, Sanghoon Lee, Alan Conrad...