Results 1  10
of
19,478
Backtracking in distributed constraint networks
 International Journal on Artificial Intelligence Tools
, 1998
"... The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the potential speedup of a parallel exploration in the processing of distributed problems. This paper extends DIBT, a distri ..."
Abstract

Cited by 90 (15 self)
 Add to MetaCart
distributed search procedure operating in distributed constraint networks [6]. The extension is twofold. First the procedure is updated to face delayed information problems upcoming in heterogeneous systems. Second, the search is extended to simultaneously explore independent parts of a distributed search
Valued Constraint Networks
 IN PROCEEDINGS OF THE SIXTH CONFERENCE ON PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING
, 2000
"... One of the limitation of the constraint network formalism lies in its inability of explicitly expressing a criteria to optimize. The introduction of several adhoc optimization mechanisms in constraint (logic) programming languages shows how important this restriction is. Several formalisms of var ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
One of the limitation of the constraint network formalism lies in its inability of explicitly expressing a criteria to optimize. The introduction of several adhoc optimization mechanisms in constraint (logic) programming languages shows how important this restriction is. Several formalisms
On Minimal Constraint Networks
, 2011
"... In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. It was conjectured that computing a solution to such a network is NP hard. We prove this conjecture. We also prove a conjecture by Dechter and Pearl stating that for k ≥ 2 it is NPhard to de ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. It was conjectured that computing a solution to such a network is NP hard. We prove this conjecture. We also prove a conjecture by Dechter and Pearl stating that for k ≥ 2 it is NP
On Fuzzy Temporal Constraint Networks
 MATHWARE AND SOFT COMPUTING
, 1994
"... Temporal Constraint Networks are a welldefined, natural and efficient formalism for representing temporal knowledge based on metric temporal constraints. They support the representation of both metric and some qualitative temporal relations and are provided with efficient algorithms based on CS ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
Temporal Constraint Networks are a welldefined, natural and efficient formalism for representing temporal knowledge based on metric temporal constraints. They support the representation of both metric and some qualitative temporal relations and are provided with efficient algorithms based
On the minimality and decomposability of constraint networks
 In Proc. of the 10th National Conf. on AI
, 1992
"... Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint network, we often wish to (i) nd a solution that satis es the constraints and (ii) nd the corresponding minimal network where ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint network, we often wish to (i) nd a solution that satis es the constraints and (ii) nd the corresponding minimal network where
Arc Consistency for General Constraint Networks: Preliminary Results
, 1997
"... Constraint networks are used more and more to solve combinatorial problems in reallife applications. Much activity is concentrated on improving the efficiency of finding a solution in a constraint network (the constraint satisfaction problem, CSP). Particularly, arc consistency caught many research ..."
Abstract

Cited by 135 (14 self)
 Add to MetaCart
Constraint networks are used more and more to solve combinatorial problems in reallife applications. Much activity is concentrated on improving the efficiency of finding a solution in a constraint network (the constraint satisfaction problem, CSP). Particularly, arc consistency caught many
Routing in a Delay Tolerant Network
, 2004
"... We formulate the delaytolerant networking routing problem, where messages are to be moved endtoend across a connectivity graph that is timevarying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no con ..."
Abstract

Cited by 621 (8 self)
 Add to MetaCart
We formulate the delaytolerant networking routing problem, where messages are to be moved endtoend across a connectivity graph that is timevarying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property
Convex Position Estimation in Wireless Sensor Networks
"... A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem fo ..."
Abstract

Cited by 493 (0 self)
 Add to MetaCart
A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem
On Binary Constraint Networks
, 1988
"... It is wellknown that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) [Pei92]. CSPs may be represented by binary constraint networks (BCNs), which can be represented by a graph with nodes for variables for which values are to be found in the domain of intere ..."
Abstract

Cited by 41 (5 self)
 Add to MetaCart
It is wellknown that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) [Pei92]. CSPs may be represented by binary constraint networks (BCNs), which can be represented by a graph with nodes for variables for which values are to be found in the domain
Results 1  10
of
19,478