55 search results - page 5 / 11 » Engineering Fast Route Planning Algorithms |
111
click to vote
SSD
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
111
Voted
SLIP
2005
ACM
15 years 5 months ago
2005
ACM
The interconnection architecture of FPGAs such as switches dominates performance of FPGAs. Three-dimensional integration of FPGAs overcomes interconnect limitations by allowing in...
74
Voted
DAC
2003
ACM
16 years 18 days ago
2003
ACM
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
112
click to vote
HEURISTICS
2000
14 years 11 months ago
2000
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the p...
83
Voted
DAC
2003
ACM
16 years 18 days ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...