438 search results - page 23 / 88 » A Theory of Competitive Analysis for Distributed Algorithms |
IPSN
2004
Springer
14 years 23 days ago
2004
Springer
Wireless sensor networks are capable of collecting an enormous amount of data over space and time. Often, the ultimate objective is to derive an estimate of a parameter or functio...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
We study jitter control in networks with guaranteed quality of service (QoS) from the competitive analysis point of view: we propose on-line algorithms that control jitter and comp...
GECCO
2005
Springer
14 years 28 days ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
FOGA
2011
12 years 11 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...