Fuzzzy constraint network topology and evolutionary hill-climbing
Abstract
References
Recommendations
Constraint satisfaction using a hybrid evolutionary hill-climbing algorithm that performs opportunistic arc and path revision
AAAI'96: Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1This paper introduces a hybrid evolutionary hill-climbing algorithm that quickly solves Constraint. Satisfaction Problems (CSPs). This hyhrid uses opportunistic arc and path revision in an interleaved fashion to reduce the size of the search space and ...
Solving distributed asymmetric constraint satisfaction problems using an evolutionary society of hill-climbers
GECCO'03: Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartIThe distributed constraint satisfaction problem (DisCSP) can be viewed as a 4-tuple (X, D, C, A), where X is a set of n variables, D is a set of n domains (one domain for each of the n variables), C is a set of constraints that constrain the values that ...
Comments
Information & Contributors
Information
Published In

- Conference Chair:
- Tom Cheatham,
- Program Chairs:
- Chrisila Pettey,
- Larry Dowdy,
- Jungsoon Yoo
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 60Total Downloads
- Downloads (Last 12 months)30
- Downloads (Last 6 weeks)14
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in