Exceeding the efficiency of distributed approximate algorithms enabling by the multiplexing method

Authors:
Yasuki Iizuka;Kayo Iizuka
Affiliations:
School of Science, Tokai University, Kanagawa, Japan;School of Network and Information, Senshu University, Kanagawa, Japan
Venue:
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part III
Year:
2011

Citing 8
Cited 1

Algorithm portfolios

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
Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks

Artificial Intelligence - Special issue: Distributed constraint satisfaction
Adopt: asynchronous distributed constraint optimization with quality guarantees

Artificial Intelligence - Special issue: Distributed constraint satisfaction

The optimal solution attainment rate of the multiplexing method

KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed constraint optimization problems have attracted attention as a method for resolving distribution problems in multiagent environments. In this paper, the authors propose a multiplex method aiming to improve the efficiency of a distributed nondeterministic approximate algorithm for distributed constraint optimization problems. Since much of the calculation time is used to transmit messages, improving efficiency using a multiplex calculation of distributed approximate algorithms might be feasible on the presupposition that the calculation time of each node or a small change in message length has no direct impact. The authors conducted a theoretical analysis of efforts to improve efficiency using a multiplex calculation of distributed approximate algorithms using extreme value theory and verifying with an experiment of a simple algorithm. A significant reduction in calculation time and improvement in the quality of the solution was ascertained, as a result of the experiment.