منابع مشابه
Extending Dual Arc Consistency
Comparisons between primal and dual approaches have recently been extensively studied and evaluated from a theoretical standpoint based on the amount of pruning achieved by each of these when applied to non-binary constraint satisfaction problems. Enforcing arc consistency on the dual encoding has been shown to strictly dominate enforcing GAC on the primal encoding (Stergiou & Walsh 1999). More...
متن کاملExtending Generalized Arc Consistency
Generalized arc consistency (GAC) is the most widely used local consistency in constraint programming. Several GAC algorithms for specific constraints, as well as generic algorithms that can be used on any constraint, have been proposed in the literature. Stronger local consistencies than GAC have also been studied but algorithms for such consistencies are generally considered too expensive. In...
متن کاملExtending GENET with lazy arc consistency
Constraint satisfaction problems (CSP's) naturally occur in a number of important industrial applications, such as planning, scheduling and resource allocation. GENET is a neural network simulator to solve binary constraint satisfaction problems. GENET uses a convergence procedure based on a relaxed form of local consistency to nd assignments which are locally minimal in terms of constraint vio...
متن کاملAnd Tam : Extending Genet with Lazy Arc Consistency 101
| Many important applications, such as graph coloring, scheduling and production planning, can be solved by GENET, a local search method which is used to solve binary constraint satisfaction problems (CSPs). Where complete search methods are typically augmented with consistency methods to reduce the search, local search methods are not. We propose a consistency technique, lazy arc consistency ,...
متن کاملExtending Soft Arc Consistency Algorithms to Non-invertible Semirings
We extend arc consistency algorithms proposed in the literature in order to deal with not necessarily invertible semirings. As a result, consistency algorithms can now be used as a preprocessing procedure in soft CSPs defined over a larger class of semirings: either partially ordered, or with non idempotent ×, or not closed ÷ operator, or constructed as cartesian product or Hoare power sets of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pattern Recognition and Artificial Intelligence
سال: 2003
ISSN: 0218-0014,1793-6381
DOI: 10.1142/s0218001403002654