3702 search results - page 311 / 741 » All Pairings Are in a Group |
182
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
185
Voted
SPAA
2006
ACM
16 years 22 days ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
179
click to vote
KI
2005
Springer
16 years 9 days ago
2005
Springer
The point algebra is a fundamental formal calculus for spatial and temporal reasoning. We present a new generalization that meets all requirements to describe dependencies on netw...
205
Voted
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
199
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding...