115 search results - page 4 / 23 » Reinforcing Reachable Routes |
IMC
2009
ACM
13 years 11 months ago
2009
ACM
Reachability is thought of as the most basic service provided by today’s Internet. Unfortunately, this does not imply that the community has a deep understanding of it. Research...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
NIPS
1993
13 years 6 months ago
1993
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communicati...
DAC
1993
ACM
13 years 9 months ago
1993
ACM
We present an efficient and effective method for the detailed routing of symmetrical or sea-of-gates FPGA architectures. Instead of breaking the problem into 2-terminal net collec...
VLSID
2005
IEEE
13 years 10 months ago
2005
IEEE
The primary advantage of using 3D-FPGA over 2D-FPGA is that the vertical stacking of active layers reduce the Manhattan distance between the components in 3D-FPGA than when placed...