Sciweavers

173 search results - page 25 / 35
» Search Complexities for HTN Planning
Sort
View
VLDB
1995
ACM
129views Database» more  VLDB 1995»
13 years 11 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
DELOS
2000
13 years 8 months ago
Challenging Ubiquitous Inverted Files
Stand-alone ranking systems based on highly optimized inverted file structures are generally considered `the' solution for building search engines. Observing various developm...
Arjen P. de Vries
ICDE
2002
IEEE
209views Database» more  ICDE 2002»
14 years 8 months ago
Geometric-Similarity Retrieval in Large Image Bases
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
Ioannis Fudos, Leonidas Palios, Evaggelia Pitoura
ISRR
2001
Springer
161views Robotics» more  ISRR 2001»
13 years 12 months ago
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
Gildardo Sánchez-Ante, Jean-Claude Latombe
STAIRS
2008
113views Education» more  STAIRS 2008»
13 years 9 months ago
Integrating individual and social intelligence into module-based agents without central coordinator
Robots are complex entities that can be modeled as multi-agent systems. The multi-agent paradigm provides an integrated intelligence framework such as a path planning agent that us...
Bianca Innocenti, Beatriz López, Joaquim Sa...