Sciweavers

804 search results - page 38 / 161
» On the Termination of the Chase Algorithm
Sort
View
69
Voted
FOSSACS
2010
Springer
15 years 7 months ago
Forward Analysis of Depth-Bounded Processes
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
Thomas Wies, Damien Zufferey, Thomas A. Henzinger
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
15 years 17 days ago
Computations of probabilistic output admissible set for uncertain constrained systems
Abstract-- This paper considers uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set which is a set of initial states prob...
Takeshi Hatanaka, Kiyotsugu Takaba
143
Voted
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
14 years 7 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
Hagit Attiya, Keren Censor-Hillel
91
Voted
COMSUR
2006
84views more  COMSUR 2006»
15 years 15 days ago
A survey of handover algorithms in DVB-H
Digital Video Broadcasting for Handhelds (DVB-H) is a standard for broadcasting IP Datacast (IPDC) services to mobile handheld terminals. Based on the DVB-T standard, DVB-H adds n...
Xiaodong Yang, Jani Väre, Thomas J. Owens
124
Voted
MSO
2003
15 years 1 months ago
Simulation based Development of Efficient Hardware for Sort based Algorithms
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
Niklas Hansson, Jay H. Harris