Sciweavers

842 search results - page 35 / 169
» Search Control Techniques for Planning
Sort
View
DCC
1999
IEEE
14 years 1 months ago
Complexity-Distortion Tradeoffs in Vector Matching Based on Probabilistic Partial Distance Techniques
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
Krisda Lengwehasatit, Antonio Ortega
AIPS
2000
13 years 10 months ago
Planning with Conflicting Advice
The paradigm of advisable planning, in which a user provides guidance to influence the content of solutions produced by an underlying planning system, holds much promise for impro...
Karen L. Myers
SAB
2004
Springer
159views Optimization» more  SAB 2004»
14 years 2 months ago
Swarming Behavior Using Probabilistic Roadmap Techniques
While techniques exist for simulating swarming behaviors, these methods usually provide only simplistic navigation and planning capabilities. In this review, we explore the benefi...
O. Burçhan Bayazit, Jyh-Ming Lien, Nancy M....
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
14 years 1 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
AIPS
2004
13 years 10 months ago
Guiding Planner Backjumping Using Verifier Traces
In this paper, we show how a planner can use a modelchecking verifier to guide state space search. In our work on hard real-time, closed-loop planning, we use a modelchecker'...
Robert P. Goldman, Michael J. S. Pelican, David J....