Sciweavers

638 search results - page 29 / 128
» Competitive contagion in networks
Sort
View
SPAA
2003
ACM
14 years 1 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
SECON
2010
IEEE
13 years 5 months ago
Coexistence-Aware Scheduling for Wireless System-on-a-Chip Devices
Abstract--Today's mobile devices support many wireless technologies to achieve ubiquitous connectivity. Economic and energy constraints, however, drive the industry to impleme...
Lei Yang, Vinod Kone, Xue Yang, York Liu, Ben Y. Z...
IPPS
2007
IEEE
14 years 2 months ago
Real-Time Distributed Scheduling of Precedence Graphs on Arbitrary Wide Networks
Previous work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. This paper presents a new distributed dynamic scheduling scheme for sporadic re...
Franck Butelle, Mourad Hakem, Lucian Finta
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
14 years 1 months ago
RABNET: a real-valued antibody network for data clustering
This paper proposes a novel constructive learning algorithm for a competitive neural network. The proposed algorithm is developed by taking ideas from the immune system and demons...
Helder Knidel, Leandro Nunes de Castro, Fernando J...
ICC
2008
IEEE
166views Communications» more  ICC 2008»
14 years 2 months ago
Multi-Initiator Connected Dominating Set Construction for Mobile Ad Hoc Networks
— The connected dominating set (CDS) has been extensively used for routing and broadcast in mobile ad hoc networks. While existing CDS protocols are successful in constructing CD...
Kazuya Sakai, Fangyang Shen, Kyoung Min Kim, Min-T...