20,718 Hits in 4.5 sec

Page 8259 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
This leads to polynomial- time algorithms for computing globally consistent labelings for a large class of constraint satisfaction problems with continuous variables.” 90C Mathematical programming 98m:  ...  “Previous work has shown that when constraints are convex and binary, path-consistency is sufficient to ensure global consistency.  ... 

Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation [chapter]

Marco Platzner, Bernhard Rinner, Reinhold Weiss
1996 J.UCS The Journal of Universal Computer Science  
This paper presents results from parallelizing constraint satisfaction in a special application | the algorithm for qualitative simulation QSim Kuipers 94 .  ...  A parallel-agent based strategy PAB is used to solve the constraint satisfaction problem CSP.  ...  Parallel Constraint Satisfaction Existing Algorithms Many parallel algorithms for constraint satisfaction are known in literature.  ... 
doi:10.1007/978-3-642-80350-5_68 fatcat:gs7vyzgajng7ncihvovc37btoy

Distributed partial constraint satisfaction problem [chapter]

Katsutoshi Hirayama, Makoto Yokoo
1997 Lecture Notes in Computer Science  
We also present new algorithms for solving Distributed Maximal Constraint Satisfaction Problems (DM-CSPs), which belong to an important class of DPCSP.  ...  This paper provides the Distributed Partial Constraint Satisfaction Problem (DPCSP) as a new framework for dealing with over-constrained situations.  ...  Conclusions We h a ve presented the distributed partial constraint satisfaction problem as a new framework for dealing with over-constrained distributed CSPs.  ... 
doi:10.1007/bfb0017442 fatcat:ipnnmyy5abhnloznmkjtsxhfry

Page 4539 of Mathematical Reviews Vol. , Issue 91H [page]

1991 Mathematical Reviews  
for local consistency in constraint networks.” 91h:68079 68Q25 68P25 90C10 Kelly, J.  ...  Frieze (1-CMU) 91h:68078 68Q25 68T30 Kasif, Simon (1-JHOP-D) On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence 45 (1990), no. 3, 275-286.  ... 

Syntactic graphs and constraint satisfaction

Jeff Martin
1991 Proceedings of the 29th annual meeting on Association for Computational Linguistics -  
I will identify some properties of linguistic constraints which allow this problem to be solved efficiently using constraint satisfaction algorithms.  ...  Path consistency can be generalized to paths of arbitrary length.  ... 
doi:10.3115/981344.981400 dblp:conf/acl/Martin91 fatcat:6kx3xadcozg4xotu2sm7cj57u4

Temporal constraint satisfaction in matrix method

Chengqi Zhang, Shichao Zhang, Zili Zhang
2003 Applied Artificial Intelligence  
Thus, the propagating rules and the algorithms of 3-and path-consistency are studied.  ...  After building a matrix method to deal with temporal reasoning problems, we develop basic techniques for applying the matrix method to constraint satisfaction in this paper.  ...  We would like to thank the anonymous reviewers for their good comments on this paper.  ... 
doi:10.1080/713827103 fatcat:62wvpyexkvhftkxixt4k5h6rlq

Forthcoming Papers

2002 Artificial Intelligence  
A sound and complete algorithm for consistency checking and for deriving a solution is presented.  ...  Binary vs. non-binary constraints There are two well known transformations from non-binary constraints to binary constraints applicable to constraint satisfaction problems (CSPs) with finite domains: the  ...  We provide a simple, automatic method for checking the 1-independence property-this method is applicable whenever the consistency of the constraints under consideration can be decided by path-consistency  ... 
doi:10.1016/s0004-3702(02)00281-3 fatcat:6gorcgplazbgtpkw4sdr7oajwa

Series-Parallel and Tree-Decomposition Approaches for Fuzzy Constraint Networks [chapter]

Alfonso Bosch, Francisco Guil, Carmen Martinez, Roque Marin
2002 Lecture Notes in Computer Science  
In this work, we present a Fuzzy Constraint Networks model for discrete domains, which generalizes the Disjunctive Fuzzy Temporal Constraint Networks model for temporal reasoning, and we propose the use  ...  After a separate empirical evaluation process of both techniques, a combined evaluation process over the same problem repository has been carried out, finding that series-parallel problems practically  ...  Fig. 1 . 1 Example of series-parallel network Fig. 2 . 2 Example of non series-parallel networkThe proposed algorithm for checking if a network is series-parallel (a variant of the algorithm proposed  ... 
doi:10.1007/3-540-36131-6_28 fatcat:5h674ijutbbglcblmrsg72f7uq

A hybrid evolutionary approach for solving constrained optimization problems over finite domains

J. Ruz, F. Saenz, L. Araujo, A. Ruiz-Andino
2000 IEEE Transactions on Evolutionary Computation  
A novel approach for the integration of evolution programs and constraint-solving techniques over finite domains is presented.  ...  In this approach, genetic operators are based on an arc-consistency algorithm, and chromosomes are arc-consistent portions of the search space of the problem.  ...  Fogel, for the careful reading and comments that improved the presentation of this paper.  ... 
doi:10.1109/4235.887235 fatcat:epxxfudgjnf55hq5xrvoqcxyli

In pursuit of the holy grail

E. Freuder
1996 ACM Computing Surveys  
The central part of the paper is dedicated to the description of main constraint satisfaction techniques and industrial applications.  ...  Constraint programming (CP) is an emergent software technology for declarative description and effective solving of large, particularly combinatorial, problems especially in areas of planning and scheduling  ...  Therefore path consistency algorithms can work with triples of variables (paths of length 2).  ... 
doi:10.1145/242224.242304 fatcat:uugoyii6vrd4jhabyqi3jw6qcu

Pure Dominance Constraints [chapter]

Manuel Bodirsky, Martin Kutz
2002 Lecture Notes in Computer Science  
The task is to find a tree structure satisfying these constraints. Our algorithm constructs such a solution in time O(m 2 ) where m is the number of constraints.  ...  Pure dominance constraints partially describe unlabeled rooted trees. For arbitrary pairs of nodes they specify sets of admissible relative positions in a tree.  ...  We want to thank Denys Duchier and Joachim Niehren for pointing us to the constraint problem, and an anonymous referee for his usefull remarks.  ... 
doi:10.1007/3-540-45841-7_23 fatcat:x2i5cgmwlbey7gplr4362vikgy

A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint [article]

Willem Jan van Hoeve
2004 arXiv   pre-print
This paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flow problem.  ...  Consistency of the constraint can be checked in O(nm) time, and hyper-arc consistency is achieved in O(m) time, where n is the number of variables involved and m is the sum of the cardinalities of the  ...  Acknowledgements Many thanks to Bert Gerards for valuable comments. Thanks also go to Sebastian Brand for fruitful discussion.  ... 
arXiv:cs/0407043v1 fatcat:iystekerhbclxe23y4xtmiaifu

Page 5106 of Mathematical Reviews Vol. , Issue 93i [page]

1993 Mathematical Reviews  
Summary: “We discuss how better arc consistency algorithms for constraint satisfaction can be developed by exploiting parallelism and domain-specific problem characteristics.  ...  A massively parallel algorithm for arc consistency is given, expressed as a digital circuit.  ... 

A Parallel Implementation of Unscheduled Flow Control in Interconnected Power Systems

G. Ozdemir Dag, Mustafa Bagriyanik
2012 Mathematical Problems in Engineering  
In this study, a parallel implementation of a multiobjective optimization approach based on both genetic algorithms and fuzzy decision making to manage unscheduled flows is presented.  ...  Two different cases for some parameters of GA are considered to see the power of parallel computation technique. Then the simulation results are presented.  ...  However, using the proposed method, one can find a feasible solution that maximizes the satisfaction degree. Once the problem is formulated, we solve it using parallel genetic algorithms.  ... 
doi:10.1155/2012/376291 fatcat:webosjp6ezeghmh23rlycvuqtu

The complexity of constraint satisfaction revisited

Alan K. Mackworth, Eugene C. Freuder
1993 Artificial Intelligence  
This paper is a retrospective account of some of the developments leading up to, and ensuing from, the analysis of the complexity of some polynomial network consistency algorithms for constraint satisfaction  ...  Freuder, The complexity of constraint satisfaction revisited, Artificial Intelligence 59 (1993) 57-62.  ...  Conclusion The development of constraint satisfaction algorithms was originally motivated by concerns for efficiency.  ... 
doi:10.1016/0004-3702(93)90170-g fatcat:q6o4666cabedzdqfljt5hbbq3u
« Previous Showing results 1 — 15 out of 20,718 results