7133 search results - page 298 / 1427 » Communication algorithms with advice |
157
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
199
click to vote
WSC
2001
15 years 8 months ago
2001
We address performance issues associated with simulationbased algorithms for optimizing Markov reward processes. Specifically, we are concerned with algorithms that exploit the re...
183
click to vote
PDPTA
2003
15 years 8 months ago
2003
Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessaril...
181
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
153
click to vote
DC
2010
15 years 6 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...