Sciweavers

122 search results - page 10 / 25
» Fast computation of SimRank for static and dynamic informati...
Sort
View
SPAA
2003
ACM
14 years 21 days ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 7 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
13 years 11 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
ADHOC
2007
126views more  ADHOC 2007»
13 years 7 months ago
Energy-aware routing in sensor networks: A large system approach
In many sensor networking environments, the sensor nodes have limited battery capacity and processing power. Hence, it is imperative to develop solutions that are energy-efficient...
Longbi Lin, Ness B. Shroff, R. Srikant
APWEB
2006
Springer
13 years 11 months ago
Efficient Dynamic Traffic Navigation with Hierarchical Aggregation Tree
Nowadays, the rapid advances in wireless communications, positioning techniques and mobile devices enable location based service such as dynamic traffic navigation. Yet, it is a ch...
Yun Bai, Yanyan Guo, Xiaofeng Meng, Tao Wan, Karin...