Sciweavers

511 search results - page 73 / 103
» Lower bounds for distributed markov chain problems
Sort
View
CORR
2007
Springer
148views Education» more  CORR 2007»
13 years 7 months ago
Blind Estimation of Multiple Carrier Frequency Offsets
Multiple carrier-frequency offsets (CFO) arise in a distributed antenna system, where data are transmitted simultaneously from multiple antennas. In such systems the received sign...
Yuanning Yu, Athina P. Petropulu, H. Vincent Poor,...
ASMTA
2008
Springer
167views Mathematics» more  ASMTA 2008»
13 years 9 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber
DC
2010
13 years 8 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
CDC
2010
IEEE
125views Control Systems» more  CDC 2010»
12 years 11 months ago
Persistent patrol with limited-range on-board sensors
— We propose and analyze the Persistent Patrol Problem (PPP). An unmanned aerial vehicle (UAV) moving with constant speed and unbounded acceleration patrols a bounded region of t...
Vu Anh Huynh, John Enright, Emilio Frazzoli
PDCAT
2005
Springer
14 years 1 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...