Sciweavers

474 search results - page 91 / 95
» On Multicast Path Finding Algorithms
Sort
View
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...
AAAI
1996
13 years 9 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
DAS
2010
Springer
13 years 6 months ago
Automatic unsupervised parameter selection for character segmentation
A major difficulty for designing a document image segmentation methodology is the proper value selection for all involved parameters. This is usually done after experimentations o...
Georgios Vamvakas, Nikolaos Stamatopoulos, Basilio...
RAS
2006
126views more  RAS 2006»
13 years 7 months ago
Multi-robot cooperation-based mobile printer system
This paper proposes a mobile printer system (MPS) based on multi-robot cooperation. The system consists of multiple mobile robots, a wireless LAN system, a graphic user interface ...
Kang-Hee Lee, Jong-Hwan Kim