Sciweavers

4075 search results - page 78 / 815
» Modeling Distributed Algorithm Using B
Sort
View
ICDE
2011
IEEE
200views Database» more  ICDE 2011»
13 years 29 days ago
Deriving probabilistic databases with inference ensembles
— Many real-world applications deal with uncertain or missing data, prompting a surge of activity in the area of probabilistic databases. A shortcoming of prior work is the assum...
Julia Stoyanovich, Susan B. Davidson, Tova Milo, V...
FMSD
2006
140views more  FMSD 2006»
13 years 9 months ago
Dealing with practical limitations of distributed timed model checking for timed automata
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
Víctor A. Braberman, Alfredo Olivero, Ferna...
IPPS
2006
IEEE
14 years 3 months ago
Formal modeling and analysis of wireless sensor network algorithms in Real-Time Maude
Advanced wireless sensor network algorithms pose challenges to their formal modeling and analysis, such as modeling probabilistic and real-time behaviors and novel forms of commun...
Peter Csaba Ölveczky, Stian Thorvaldsen
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 9 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
ICML
2010
IEEE
13 years 10 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long