Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
The Evolution of Customer Middleware Requirements
PDIS '94 Proceedings of the Third International Conference on Parallel and Distributed Information Systems
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Exceeding the efficiency of distributed approximate algorithms enabling by the multiplexing method
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part III
| Hi-index | 0.00 |
Distributed constraint optimization problems have attracted attention as a means of resolving distribution problems in multiagent environments. The author has already proposed a multiplex method targeting the improved efficiency of a distributed nondeterministic approximate algorithm for distributed constraint optimization problems. Since much of the computation time is used to transmit messages, improving efficiency using a multiplex computation of distributed approximate algorithms might be feasible, presuming that the computation time of each node or a small change in message length has no direct impact. Although it is usually impossible to guarantee that the approximation algorithm can obtain the optimal solution, the author managed to do so, using a theoretically determined multiplex method. In addition, the author shows the feasibility of an optimal solution attainment rate of 0.99 by an experiment using a Distributed Stochastic Search Algorithm.