Sciweavers

182 search results - page 30 / 37
» Routing Tree Problems on Random Graphs
Sort
View
HICSS
2000
IEEE
136views Biometrics» more  HICSS 2000»
15 years 6 months ago
Ordered End-to-End Multicast for Distributed Multimedia Systems
We address the problem of message ordering for reliable multicast communication. End-to-end multicast ordering is useful for ensuring the collective integrity and consistency of d...
Hans-Peter Dommel, J. J. Garcia-Luna-Aceves
INFOCOM
2006
IEEE
15 years 7 months ago
Designing Low Cost Networks with Short Routes and Low Congestion
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
Van Nguyen, Charles U. Martel
INFOCOM
2002
IEEE
15 years 6 months ago
Using the Small-World Model to Improve Freenet Performance
– Efficient data retrieval in a peer-to-peer system like Freenet is a challenging problem. In this paper we study the impact of cache replacement policy on the performance of Fre...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
OPODIS
2004
15 years 3 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 5 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...