Recurrent distributed constraint satisfaction, virtual constraints, and meta-evolutionary protocols

Gerry Dozier

doi:10.3233/kes-2005-9103

ScienceGate Book Chapters

JOURNAL ARTICLE

Recurrent distributed constraint satisfaction, virtual constraints, and meta-evolutionary protocols

Gerry Dozier

Year: 2005 Journal: International Journal of Knowledge-based and Intelligent Engineering Systems Vol: 9 (1)Pages: 21-31 Publisher: IOS Press

DOI: 10.3233/kes-2005-9103

Get Full-Text PDF Get Analytical Report

Abstract

The 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 valu

Keywords:

Constraint (computer-aided design) Computer science Constraint satisfaction problem Constraint satisfaction Distributed computing Artificial intelligence Mathematics

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.12

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Constraint Satisfaction and Optimization

Physical Sciences → Computer Science → Computer Networks and Communications

AI-based Problem Solving and Planning

Physical Sciences → Computer Science → Artificial Intelligence

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Recurrent distributed constraint satisfaction, virtual constraints, and meta-evolutionary protocols

Abstract

Metrics

Topics

Related Documents

Distributed Asymmetric Constraint Satisfaction, the Phase Transition, and Evolutionary Protocols

A Comparison of Evolutionary Protocols for Solving Distributed Constraint Satisfaction Problems

Global constraints in distributed constraint satisfaction

Recurrent distributed constraint satisfaction via genetic and evolutionary societies of hill-climbers

Distributed constraint satisfaction with partially known constraints