Sciweavers

763 search results - page 122 / 153
» Engineering Shortest Path Algorithms
Sort
View
ISPD
2003
ACM
89views Hardware» more  ISPD 2003»
14 years 27 days ago
Local unidirectional bias for smooth cutsize-delay tradeoff in performance-driven bipartitioning
Traditional multilevel partitioning approaches have shown good performance with respect to cutsize, but offer no guarantees with respect to system performance. Timing-driven part...
Andrew B. Kahng, Xu Xu
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 7 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
ANSS
2006
IEEE
14 years 1 months ago
Performance Study of End-to-End Traffic-Aware Routing
There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider findi...
Raad S. Al-Qassas, Lewis M. Mackenzie, Mohamed Oul...
INFOCOM
2002
IEEE
14 years 17 days ago
Energy Efficient Communications in Ad Hoc Networks Using Directional Antennas
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...
Akis Spyropoulos, Cauligi S. Raghavendra
VLDB
2000
ACM
125views Database» more  VLDB 2000»
13 years 11 months ago
Focused Crawling Using Context Graphs
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
Michelangelo Diligenti, Frans Coetzee, Steve Lawre...