Sciweavers

1578 search results - page 37 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
RT
1995
Springer
14 years 6 days ago
A Clustering Algorithm for Radiance Calculation in General Environments
: This paper introduces an efficient hierarchical algorithm capable of simulating light transfer for complex scenes containing non-diffuse surfaces. The algorithmstemsfroma newfor...
François X. Sillion, George Drettakis, Cyri...
TELSYS
2002
73views more  TELSYS 2002»
13 years 8 months ago
Avoiding Counting to Infinity in Distance Vector Routing
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...
Andreas Schmid, Christoph Steigner
LATIN
2010
Springer
13 years 7 months ago
Packet Routing on the Grid
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...
Britta Peis, Martin Skutella, Andreas Wiese
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
14 years 22 days ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
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...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
CCGRID
2004
IEEE
14 years 12 days ago
Routing and resource discovery in Phoenix Grid-enabled message passing library
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...
Kenji Kaneda, Kenjiro Taura, Akinori Yonezawa