Sciweavers

9730 search results - page 4 / 1946
» Relating models of backtracking
Sort
View
ECAI
1994
Springer
13 years 11 months ago
Operationalizing Conceptual Models Based on a Model of Dependencies
Abstract. In this paper we describe a framework for defining and operationalizing conceptual models of distributed knowledge-based systems which extends published approaches by the...
Frank Maurer, Jürgen Paulokat
CSCLP
2004
Springer
14 years 24 days ago
Characterization of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
Venkata Praveen Guddeti, Berthe Y. Choueiry
AAAI
1994
13 years 8 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
RTAS
2007
IEEE
14 years 1 months ago
A Programming Model for Time-Synchronized Distributed Real-Time Systems
Discrete-event (DE) models are formal system specifications that have analyzable deterministic behaviors. Using a global, consistent notion of time, DE components communicate via...
Yang Zhao, Jie Liu, Edward A. Lee
CP
2004
Springer
14 years 24 days ago
Backtrack-Free Search for Real-Time Constraint Satisfaction
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
J. Christopher Beck, Tom Carchrae, Eugene C. Freud...