580 search results - page 10 / 116 » Ergodic Exploration of Distributed Information |
122
Voted
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— Estimation of network proximity among nodes is an important building block in several applications like service selection and composition, multicast tree formation, and overlay...
123
click to vote
PPSN
2000
Springer
15 years 8 months ago
2000
Springer
A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide t...
141
click to vote
QEST
2009
IEEE
15 years 11 months ago
2009
IEEE
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
139
click to vote
ICDCS
2000
IEEE
15 years 9 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
119
click to vote
HICSS
2002
IEEE
15 years 9 months ago
2002
IEEE
Distributed work teams are increasingly being implemented to enhance organizational flexibility and competitiveness in today's complex and rapidly changing work environment. ...