Sciweavers

376 search results - page 7 / 76
» Hardware-Assisted Fast Routing
Sort
View
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
13 years 13 days ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
GLVLSI
2002
IEEE
127views VLSI» more  GLVLSI 2002»
14 years 2 months ago
A new look at hardware maze routing
This paper describes a new design for a hardware accelerator to support grid-based Maze Routing. Based on the direct mapped approach of Breuer and Shamsa [3], this work refines th...
John A. Nestor
APNOMS
2006
Springer
14 years 1 months ago
A DNS Based New Route Optimization Scheme with Fast Neighbor Discovery in Mobile IPv6 Networks
In this paper, we propose a new route optimization scheme (EDNS-MIPv6) for MIPv6 using the enhanced Domain Name System (DNS) together with local mobility management scheme to reduc...
Byungjoo Park, Haniph A. Latchman
TCAD
2008
65views more  TCAD 2008»
13 years 9 months ago
Fashion: A Fast and Accurate Solution to Global Routing Problem
This paper presents a fast and accurate solution, namely Fashion, to routability-driven global routing problem. Fashion is based on two efficient yet effective techniques: 1) dynam...
Zhen Cao, Tong Jing, Jinjun Xiong, Yu Hu, Zhe Feng...