96 search results - page 9 / 20 » Path Hitting in Acyclic Graphs |
105
Voted
SIGMETRICS
2011
ACM
14 years 2 months ago
2011
ACM
Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifie...
104
click to vote
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
DAM
2008
14 years 11 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
DAC
1996
ACM
15 years 3 months ago
1996
ACM
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
JUCS
2010
14 years 10 months ago
2010
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...