59 search results - page 7 / 12 » Iterative Lexicographic Path Orders |
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We address the problem of distributed path selection and rate allocation for media streaming in overlay networks. Under the assumption that each node has only a local view of the ...
DAC
1994
ACM
14 years 16 hour ago
1994
ACM
- This paper describes a symbolic formulation that allows incorporation of speculative operation execution (preexecution) in an exact control-dependent scheduling of arbitrary forw...
PC
2010
13 years 6 months ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided amon...
APPROX
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions....