Sciweavers

625 search results - page 67 / 125
» Topologically Adaptable Snakes
Sort
View
ICMLA
2004
15 years 1 months ago
A new discrete binary particle swarm optimization based on learning automata
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
Reza Rastegar, Mohammad Reza Meybodi, Kambiz Badie
IMC
2003
ACM
15 years 5 months ago
Tomography-based overlay network monitoring
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
Yan Chen, David Bindel, Randy H. Katz
CORR
2010
Springer
338views Education» more  CORR 2010»
14 years 12 months ago
Optimal Distributed P2P Streaming under Node Degree Bounds
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
Shaoquan Zhang, Ziyu Shao, Minghua Chen
ICDCS
2011
IEEE
13 years 11 months ago
Delay-Cognizant Reliable Delivery for Publish/Subscribe Overlay Networks
—The number of real-world applications that require QoS guarantees is constantly increasing and they often follow the publish/subscribe (pub/sub) messaging paradigm, which provid...
Shuo Guo, Kyriakos Karenos, Minkyong Kim, Hui Lei,...
CF
2007
ACM
15 years 3 months ago
Reconfigurable hybrid interconnection for static and dynamic scientific applications
As we enter the era of petascale computing, system architects must plan for machines composed of tens or even hundreds of thousands of processors. Although fully connected network...
Shoaib Kamil, Ali Pinar, Daniel Gunter, Michael Li...