Distributed Problem Solving Without Communication - An Examination of Computationally Hard Satisfiability Problems.
Jiming LiuXiaolong JinJing HanPublished in: Int. J. Pattern Recognit. Artif. Intell. (2002)
Keyphrases
- objective function
- satisfiability problem
- distributed problem solving
- computationally hard
- cooperative
- meta level
- conformant planning
- np complete
- np hard
- temporal logic
- search algorithm
- phase transition
- multi agent systems
- optimal solution
- sat problem
- distributed artificial intelligence
- stochastic local search
- multi agent
- mazurkiewicz traces
- artificial intelligence
- object level
- intelligent agents