5153 search results - page 747 / 1031 » Introduction to Randomized Algorithms |
133
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
136
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
135
click to vote
IPSN
2004
Springer
15 years 9 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
127
Voted
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
112
click to vote
RECOMB
1999
Springer
15 years 8 months ago
1999
Springer
An important goal in bioinformatics is determining the homology and function of proteins from their sequences. Pairwise sequence similarity algorithms are often employed for this ...