Sciweavers

547 search results - page 21 / 110
» A Planning Algorithm not based on Directional Search
Sort
View
ICTAI
2005
IEEE
14 years 1 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze
SSD
2001
Springer
103views Database» more  SSD 2001»
14 years 5 days ago
Similarity of Cardinal Directions
Like people who casually assess similarity between spatial scenes in their routine activities, users of pictorial databases are often interested in retrieving scenes that are simil...
Roop K. Goyal, Max J. Egenhofer
ECCV
2002
Springer
14 years 9 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
TREC
2007
13 years 9 months ago
Dartmouth College at TREC 2007 Legal Track
This report describes Dartmouth College’s approach and results for the 2007 TREC Legal Track. Our original plan was to use the Combination of Expert Opinion (CEO) algorithm [1],...
Wei-Ming Chen, Paul Thompson
EVOW
2006
Springer
13 years 11 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...