Sciweavers

511 search results - page 41 / 103
» Lower bounds for distributed markov chain problems
Sort
View
TSP
2010
13 years 2 months ago
Optimal/near-optimal dimensionality reduction for distributed estimation in homogeneous and certain inhomogeneous scenarios
We consider distributed estimation of a deterministic vector parameter from noisy sensor observations in a wireless sensor network (WSN). The observation noise is assumed uncorrela...
Jun Fang, Hongbin Li
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
13 years 9 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
DEDS
2010
88views more  DEDS 2010»
13 years 8 months ago
On the Performance Evaluation of Multi-Guarded Marked Graphs with Single-Server Semantics
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...
Jorge Júlvez, Jordi Cortadella, Michael Kis...
ECAI
2008
Springer
13 years 9 months ago
Dynamic Backtracking for Distributed Constraint Optimization
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
Redouane Ezzahir, Christian Bessiere, Imade Benela...
MFCS
2010
Springer
13 years 6 months ago
A dexptime-Complete Dolev-Yao Theory with Distributive Encryption
In the context of modelling cryptographic tools like blind signatures and homomorphic encryption, the DolevYao model is typically extended with an operator over which encryption i...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh