Sciweavers

239 search results - page 8 / 48
» Hardness and algorithms for rainbow connection
Sort
View
CEC
2009
IEEE
15 years 1 months ago
Towards connectivity improvement in VANETs using bypass links
VANETs are ad hoc networks in which devices are vehicles moving at high speeds. This kind of network is getting more and more importance since it has many practical and important a...
Bernabé Dorronsoro Díaz, Patricia Ru...
83
Voted
IJSIR
2010
122views more  IJSIR 2010»
14 years 4 months ago
Biases in Particle Swarm Optimization
It is known that the most common versions of particle swarm optimization (PSO) algorithms are rotationally variant. It has also been pointed out that PSO algorithms can concentrat...
William M. Spears, Derek T. Green, Diana F. Spears
SENSYS
2009
ACM
15 years 4 months ago
Achieving range-free localization beyond connectivity
Wireless sensor networks have been proposed for many location-dependent applications. In such applications, the requirement of low system cost prohibits many range-based methods f...
Ziguo Zhong, Tian He
PODC
2012
ACM
12 years 12 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
80
Voted
HPDC
2008
IEEE
15 years 3 months ago
Improving peer connectivity in wide-area overlays of virtual workstations
Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized...
Arijit Ganguly, P. Oscar Boykin, David Wolinsky, R...