1578 search results - page 37 / 316 » Direct Routing: Algorithms and Complexity |
145
Voted
RT
1995
Springer
15 years 6 months ago
1995
Springer
: This paper introduces an efficient hierarchical algorithm capable of simulating light transfer for complex scenes containing non-diffuse surfaces. The algorithmstemsfroma newfor...
125
click to vote
TELSYS
2002
15 years 2 months ago
2002
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
122
Voted
LATIN
2010
Springer
15 years 1 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
149
Voted
ISAAC
1993
Springer
15 years 6 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
132
Voted
CCGRID
2004
IEEE
15 years 6 months ago
2004
IEEE
We describe design and implementation of a "Gridenabled" message passing library, in the context of Phoenix message passing model. It supports (1) message routing betwee...