Sciweavers

1930 search results - page 15 / 386
» A Dynamic Graph Algorithm for the Highly Dynamic Network Pro...
Sort
View
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 1 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
ICDCSW
2008
IEEE
14 years 1 months ago
Understanding the Tolerance of Dynamic Networks: A Routing-Oriented Approach
Research on delay tolerant networks (DTNs) has brought about a plethora of routing algorithms targeted at networks with different mobility patterns. However, few research works ha...
Yifeng Shao, Jie Wu
ASC
2008
13 years 7 months ago
Info-fuzzy algorithms for mining dynamic data streams
Most data mining algorithms assume static behavior of the incoming data. In the real world, the situation is different and most continuously collected data streams are generated by...
Lior Cohen, Gil Avrahami, Mark Last, Abraham Kande...
IWCMC
2010
ACM
13 years 5 months ago
Dynamic load balancing and throughput optimization in 3GPP LTE networks
Load imbalance that deteriorates the system performance is a severe problem existing in 3GPP LTE networks. To deal with this problem, we propose in this paper a load balancing fra...
Hao Wang, Lianghui Ding, Ping Wu, Zhiwen Pan, Nan ...
STACS
2001
Springer
13 years 11 months ago
Generalized Langton's Ant: Dynamical Behavior and Complexity
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
Anahí Gajardo, Eric Goles Ch., André...