1016 search results - page 91 / 204 » Optimized algorithms for multi-agent routing |
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
— Multicast services can be provided either as a basic network service or as an application-layer service. Higher level multicast implementations often provide more sophisticated...
GLVLSI
2000
IEEE
15 years 2 months ago
2000
IEEE
Circuit interconnect has become a substantial obstacle in the design of high performance systems. In this paper we explore a new routing paradigm that strikes at the root of the i...
ATMOS
2010
14 years 8 months ago
2010
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...
ALGORITHMICA
2008
14 years 10 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...