Sciweavers

4642 search results - page 247 / 929
» Distributed algorithm and reversible network
Sort
View
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 10 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
GECCO
2006
Springer
253views Optimization» more  GECCO 2006»
15 years 10 months ago
A novel approach to optimize clone refactoring activity
Achieving a high quality and cost-effective tests is a major concern for software buyers and sellers. Using tools and integrating techniques to carry out low cost testing are chal...
Salah Bouktif, Giuliano Antoniol, Ettore Merlo, Ma...
CORR
2010
Springer
197views Education» more  CORR 2010»
15 years 5 months ago
Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents
—Autonomous wireless agents such as unmanned aerial vehicles, mobile base stations, or self-operating wireless nodes present a great potential for deployment in next-generation w...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...
UAI
2001
15 years 8 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
BROADNETS
2004
IEEE
15 years 10 months ago
Capacity and Delay Tradeoffs for Ad-Hoc Mobile Networks
We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad hoc network. To reduce delays in the network, each user sends redundant packets along mu...
Michael J. Neely, Eytan Modiano