Sciweavers

553 search results - page 60 / 111
» A General Theory of Additive State Space Abstractions
Sort
View
PODC
2006
ACM
14 years 2 months ago
Self-stabilizing byzantine agreement
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
Ariel Daliot, Danny Dolev
CPHYSICS
2008
123views more  CPHYSICS 2008»
13 years 8 months ago
wannier90: A tool for obtaining maximally-localised Wannier functions
We present wannier90, a program for calculating maximally-localised Wannier functions (MLWF) from a set of Bloch energy bands that may or may not be attached to or mixed with othe...
Arash A. Mostofi, Jonathan R. Yates, Young-Su Lee,...
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
14 years 8 days ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
POPL
2007
ACM
14 years 9 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
IPSN
2005
Springer
14 years 2 months ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry