Results 1  10
of
683,440
Backtrackfree search for realtime constraint satisfaction
 In CP, LNCS 3258
, 2004
"... Abstract. 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 useful in a realtime process control or online interactive context. The conventional machinery for ensuring backt ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. 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 useful in a realtime process control or online interactive context. The conventional machinery for ensuring
A sufficient condition for backtrackfree search
, 1982
"... A constraint satisfaction problem revolves finding values for a set of variables subject of a set of constraints (relations) on those variables Backtrack search is often used to solve such problems. A relationship involving the structure of the constraints i described which characterizes tosome deg ..."
Abstract

Cited by 297 (14 self)
 Add to MetaCart
A constraint satisfaction problem revolves finding values for a set of variables subject of a set of constraints (relations) on those variables Backtrack search is often used to solve such problems. A relationship involving the structure of the constraints i described which characterizes tosome
BacktrackFree Search for Resource Allocation Problems
 In Proceedings of the Constraint Reasoning Workshop at FLAIRS95
, 1995
"... Freuder [9] has previously given conditions that guarantee backtrackfree search when solving binary constraint networks. Freuder's condition relies on the "width" of the constraint network. Computing the width of a constraint network involves minimizing over all possible orderings of ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Freuder [9] has previously given conditions that guarantee backtrackfree search when solving binary constraint networks. Freuder's condition relies on the "width" of the constraint network. Computing the width of a constraint network involves minimizing over all possible orderings
Adaptive Constraint Satisfaction
 WORKSHOP OF THE UK PLANNING AND SCHEDULING
, 1996
"... Many different approaches have been applied to constraint satisfaction. These range from complete backtracking algorithms to sophisticated distributed configurations. However, most research effort in the field of constraint satisfaction algorithms has concentrated on the use of a single algorithm fo ..."
Abstract

Cited by 950 (43 self)
 Add to MetaCart
Many different approaches have been applied to constraint satisfaction. These range from complete backtracking algorithms to sophisticated distributed configurations. However, most research effort in the field of constraint satisfaction algorithms has concentrated on the use of a single algorithm
Constraint Networks
, 1992
"... Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint expression ..."
Abstract

Cited by 1149 (43 self)
 Add to MetaCart
expressions. These have been successfully applied to diverse tasks such as design, diagnosis, truth maintenance, scheduling, spatiotemporal reasoning, logic programming and user interface. Constraint networks are graphical representations used to guide strategies for solving constraint satisfaction problems
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
A Revised Sufficient Condition for BacktrackFree Search
 In Proceedings of 10th Florida AI Research Symposium
, 1997
"... In this paper, we define the notion of ! consistency and !graph associated with general nary constraint satisfaction problems and present an alternative sufficient condition for backtrackfree search; that is, if the hypergraph associated with a general CSP has a treestructured ! graph, then ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
In this paper, we define the notion of ! consistency and !graph associated with general nary constraint satisfaction problems and present an alternative sufficient condition for backtrackfree search; that is, if the hypergraph associated with a general CSP has a treestructured ! graph
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important
A Scheme for RealTime Channel Establishment in WideArea Networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1990
"... Multimedia communication involving digital audio and/or digital video has rather strict delay requirements. A realtime channel is defined in this paper as a simplex connection between a source and a destination characterized by parameters representing the performance requirements of the client. A r ..."
Abstract

Cited by 710 (31 self)
 Add to MetaCart
Multimedia communication involving digital audio and/or digital video has rather strict delay requirements. A realtime channel is defined in this paper as a simplex connection between a source and a destination characterized by parameters representing the performance requirements of the client. A
Bro: A System for Detecting Network Intruders in RealTime
, 1999
"... We describe Bro, a standalone system for detecting network intruders in realtime by passively monitoring a network link over which the intruder's traffic transits. We give an overview of the system's design, which emphasizes highspeed (FDDIrate) monitoring, realtime notification, clear ..."
Abstract

Cited by 903 (41 self)
 Add to MetaCart
We describe Bro, a standalone system for detecting network intruders in realtime by passively monitoring a network link over which the intruder's traffic transits. We give an overview of the system's design, which emphasizes highspeed (FDDIrate) monitoring, realtime notification
Results 1  10
of
683,440