Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Wiitala (1987)
Discrete Mathematics: A Unified Approach
Steven Minton, M. Johnston, Andrew Philips, P. Laird (1992)
Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling ProblemsArtif. Intell., 58
G. Dozier, D. Bahler, J. Bowen (1994)
Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithmProceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence
M. Riff (1996)
From Quasi-Solutions to Solution: An Evolutionary Algorithm to Solve CSP
Joseph Montanarella (1996)
Artificial Intelligence : A Knowledge-Based Approach
Peter Stuckey, V. Tam (1999)
Improving Evolutionary Algorithms for Efficient Constraint SatisfactionInt. J. Artif. Intell. Tools, 8
V. Tam, W. Foo, Rakesh Gupta (2000)
A fast and flexible framework of scripting for Web application development: a preliminary experience reportProceedings of the First International Conference on Web Information Systems Engineering, 1
J. Bowen, G. Dozier (1995)
Solving Constraint Satisfaction Problems Using a Genetic/Systematic Search Hybrid That Realizes When to Quit
E. Aarts, J. Korst (1989)
Boltzmann machines for travelling salesman problemsEuropean Journal of Operational Research, 39
A. Thornton (1994)
Genetic Algorithms Versus Simulated Annealing: Satisfaction of Large Sets of Algebraic Mechanical Design Constraints
(1997)
Naba Barkakati
Andrew Davenport, E. Tsang, Chang Wang, Kangmin Zhu (1994)
GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement
David Johnson, C. Aragon, L. McGeoch, C. Schevon (1991)
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOper. Res., 39
L. Wall, M. Loukides (1991)
Programming Perl
T. Cormen, C. Leiserson, R. Rivest (1990)
Introduction to Algorithms
E. Tsang (1993)
Foundations of constraint satisfaction
Given the diversity and limitedcompatibility for personal computer hardware,obtaining an (sub-)optimal configuration fordifferent usage restricted to some budgetlimits and other possible criteria can bechallenging. In this paper, we firstlyformulated these common configuration problemsas discrete optimization problems to flexiblyadd in or modify users' requirements. Moreinterestingly, we proposed two intelligentoptimizers: a simple-yet-powerful beam searchmethod and a min-conflict heuristic-basedmicro-genetic algorithm (MGA) to solve thisreal-life optimization problem. Theheuristic-based MGA consistently outperformedthe beam search and branch-and-bound method inmost test cases. Furthermore, our work opens upexciting directions for investigation.
Artificial Intelligence Review – Springer Journals
Published: Oct 10, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.