1172 search results - page 227 / 235 » Path Algorithms on Regular Graphs |
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...
INFOCOM
2002
IEEE
14 years 17 days ago
2002
IEEE
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...
SPAA
1999
ACM
13 years 12 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
EC
1998
13 years 7 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
TON
2002
13 years 7 months ago
2002
Current means of providing loop-back recovery, which is widely used in SONET, rely on ring topologies, or on overlaying logical ring topologies upon physical meshes. Loop-back is d...