416 search results - page 44 / 84 » Engineering Route Planning Algorithms |
SIGCOMM
2000
ACM
13 years 11 months ago
2000
ACM
Traffic measurement is a critical component for the control and engineering of communication networks. We argue that traffic measurement should make it possible to obtain the spati...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Multi-agent systems benefit greatly from an organization design that guides agents in determining when to communicate, how often, with whom, with what priority, and so on. However...
JCM
2007
13 years 7 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...