A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Conflict Directed Variable Selection Strategies for Constraint Satisfaction Problems
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
Constraint programming is a powerful technique for solving combinatorial search problems that draws on a wide range of methods from artificial intelligence and computer science. ...
Some of these methods exploit information about failures gathered throughout search and recorded in the form of constraint weights, while others measure the importance/impact of variable assignments for ...
As results presented here demonstrated, both major strategies for variable selection, conflicts and impacts, have strengths and weaknesses. ...
doi:10.1007/978-3-642-12842-4_7
fatcat:5axurctgvfdzlesg2zjpfgamoe
Interactive Heuristic Search Algorithm
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a hybrid heuristic search algorithm for constraint satisfaction problems. ...
We present the results using the well known n-queens problem. ...
Conclusion We presented a promising algorithm for solving finite constraint satisfaction problems, which combines principles of the local search with other techniques for solving constraint satisfaction ...
doi:10.1007/3-540-46135-3_63
fatcat:3j2p55dfmzaalhq6ux2kbxweg4
Multi-user variability configuration: A game theoretic approach
2013
2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Multi-user configuration is a neglected problem in variability-intensive systems area. The appearance of conflicts among user configurations is a main concern. ...
We focus on cooperative game theory to propose and automate a tradeoff-based bargaining approach, as a way to solve the conflicts and maximize user satisfaction at the same time. ...
For our purposes, we have extended FaMa, adding a Constraint Satisfaction Problem based implementation of this new operation using Choco solver 2 . ...
doi:10.1109/ase.2013.6693115
dblp:conf/kbse/Garcia-GalanTC13
fatcat:oxq4anmn6jexrpxrebd6ds66qi
Generating feasible strategies in nuclear emergencies—a constraint satisfaction problem
1999
Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Finding a solution for a constraint satisfaction problem consists of assigning a value to every variable from its domain so that every constraint is satis- fied. ...
constraints it was decided to opt for a particular constraint whenever a conflict occurs. ...
doi:10.1057/palgrave.jors.2600743
fatcat:dtwusjinkjatzn66zu3togyn2y
Top-kBased Adaptive Enumeration in Constraint Programming
2015
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this context, a main component is the enumeration strategy, which is responsible for selecting the order in which variables and values are selected to build a possible solution. ...
Constraint programming effectively solves constraint satisfaction and optimization problems by basically building, pruning, and exploring a search tree of potential solutions. ...
Introduction Constraint programming (CP) is a modern and efficient programming paradigm for solving complex constraint satisfaction and optimization problems. ...
doi:10.1155/2015/580785
fatcat:r34gyihmabftvdwfigdvds7v2a
Management of conflict for preliminary engineering design tasks
1995
Artificial intelligence for engineering design, analysis and manufacturing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Conflict management strategies consist of three generic mechanisms adapted to the type of constraints involved. ...
These strategies may be refined through consideration of variable importance, context, and design inertia. ...
ACKNOWLEDGMENTS Funding for this research was provided by the Swiss National Science Foundation. The authors thank Boi Faltings for useful discussions. Also, the contribution of Dr. ...
doi:10.1017/s0890060400002857
fatcat:bmovr6uiqfelfb3rrjkk2vy4ey
Towards an immune system that solves CSP
2007
2007 IEEE Congress on Evolutionary Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose an immune system which is able to solve hard constraint satisfaction problems. ...
The tests were carried out using random generated binary constraint satisfaction problems on the transition phase. ...
PROBLEM FORMULATION We consider a constraint satisfaction problem (CSP) as defined by Mackworth [9] , which can be stated briefly as follows: Given a set of variables, a domain of possible values for ...
doi:10.1109/cec.2007.4424831
dblp:conf/cec/RiffZ07
fatcat:i4eta35nzvfqfggia2f5tw4uoi
In pursuit of the holy grail
1996
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2001; you can also visit the original URL.
The file type is application/pdf.
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 ...
The central part of the paper is dedicated to the description of main constraint satisfaction techniques and industrial applications. ...
Another problem is choosing the right constraint satisfaction technique for particular problem. ...
doi:10.1145/242224.242304
fatcat:uugoyii6vrd4jhabyqi3jw6qcu
Diagnosing and Solving Over-Determined Constraint Satisfaction Problems
1993
International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appropriate constraints. ...
constraint satisfaction problem. ...
It depends on the computational complexity of the selected method for solving constraint satisfaction problems (all of which have an exponential worst-case computational complexity in the number of variables ...
dblp:conf/ijcai/BakkerDTW93
fatcat:licfxgp5infapdpdkzhxl53zli
Bridging the gap between planning and scheduling
2000
Knowledge engineering review (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also argue that many difficult practical problems lie somewhere between planning and scheduling, and that neither area has the right set of tools for solving these vexing problems. ...
One cannot specify the duration of an action or specify time constraints on either goals or actions. ...
Acknowledgements Thanks to John Bresina, Carla Gomes, Keith Golden, Dan Weld, and two anonymous reviewers for comments on earlier drafts of this paper ...
doi:10.1017/s0269888900001089
fatcat:kfnjhgvgine5rbxgyisvzosdpu
A Hybrid-Based Framework for Constraint Satisfaction Optimization Problems
2001
International Conference on Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Both of these problems fall under the domain of constraint satisfaction optimization problems (CSOP), which involves finding a solution that satisfies all hard constraints, while at the same time maximizing ...
In this paper, we propose a framework for CSOP that combines both constraint satisfaction and optimization techniques into a hybrid algorithm, called the combined method (CM). ...
We feel that the combined method can be used for almost any constraint satisfaction optimization problem, including scheduling and timetabling tasks. ...
dblp:conf/icis/HoL01
fatcat:67qznekpwzcy5icehdx36ocf6a
Performance models for large scale multiagent systems
2003
Proceedings of the second international joint conference on Autonomous agents and multiagent systems - AAMAS '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present our approach in the context of DCSPs (distributed constraint satisfaction problems), where we first show that there is a large bank of conflict resolution strategies and no strategy dominates ...
While performance models of such coordination or conflict resolution strategies could aid in selecting the right strategy for a given domain, such models remain largely uninvestigated in the multiagent ...
Formally, there is a set of m agents, There are two types of constraints based on whether variables in a constraint belong to a single agent or not: A Constraint Satisfaction Problem (CSP) is commonly ...
doi:10.1145/860620.860623
fatcat:7fgdx26g5bgxjojxwtgcc2bdim
Performance models for large scale multiagent systems
2003
Proceedings of the second international joint conference on Autonomous agents and multiagent systems - AAMAS '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present our approach in the context of DCSPs (distributed constraint satisfaction problems), where we first show that there is a large bank of conflict resolution strategies and no strategy dominates ...
While performance models of such coordination or conflict resolution strategies could aid in selecting the right strategy for a given domain, such models remain largely uninvestigated in the multiagent ...
Formally, there is a set of m agents, There are two types of constraints based on whether variables in a constraint belong to a single agent or not: A Constraint Satisfaction Problem (CSP) is commonly ...
doi:10.1145/860575.860623
dblp:conf/atal/JungT03
fatcat:jdq74e5hkrduvdrbdjm3hiidbu
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
2000
The Journal of Artificial Intelligence Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search techniques to the Graphplan algorithm ...
It then describes how explanation based learning, dependency directed backtracking, dynamic variable ordering, forward checking, sticky values and random-restart search strategies can be adapted to Graphplan ...
Finally, I thank Mark Peot and David Smith for their clean Lisp implementation of the Graphplan algorithm, which served as the basis for my extensions. ...
doi:10.1613/jair.655
fatcat:ggecgeslxrewdiz6kubgo3kvvy
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
1992
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Laird, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence 58 (1992) 161-205. ...
The paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. ...
We also thank Ron Rusick and our anonymous reviewers for their comments. The Space Telescope Science Institute is operated by the Association of Universities for Research in Astronomy for NASA. ...
doi:10.1016/0004-3702(92)90007-k
fatcat:raunue5n3fgztecexaorcxfyjq
« Previous
Showing results 1 — 15 out of 57,691 results