Sciweavers

3991 search results - page 178 / 799
» Bounding homogeneous models
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 1 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
STOC
2009
ACM
107views Algorithms» more  STOC 2009»
14 years 8 months ago
Efficient discrete-time simulations of continuous-time quantum query algorithms
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...
Richard Cleve, Daniel Gottesman, Michele Mosca, Ro...
PRDC
2006
IEEE
14 years 2 months ago
Leader Election in the Timed Finite Average Response Time Model
The finite average response time model is a very weak distributed systems model: it permits runs with unbounded transmission and processing delays and it does not bound the relat...
Christof Fetzer, Martin Süßkraut
FUIN
2007
99views more  FUIN 2007»
13 years 8 months ago
Verifying Security Protocols Modelled by Networks of Automata
In this paper we show a novel method for modelling behaviours of security protocols using networks of communicating automata in order to verify them with SAT-based bounded model ch...
Miroslaw Kurkowski, Wojciech Penczek
EWRL
2008
13 years 10 months ago
Efficient Reinforcement Learning in Parameterized Models: Discrete Parameter Case
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
Kirill Dyagilev, Shie Mannor, Nahum Shimkin