Benchmarking hybrid algorithms for distributed constraint optimisation games

E-ISSN： 1573-7454|22|3|385-414

ISSN： 1387-2532

Source： Autonomous Agents and Multi-Agent Systems, Vol.22, Iss.3, 2011-05, pp. : 385-414

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Towards unbiased benchmarking of evolutionary and hybrid algorithms for real-valued optimisation

By Macnish Cara

Connection Science, Vol. 19, Iss. 4, 2007-12 ,pp. : 361-385

Taylor & Francis Ltd

Access to resources Recommend Favorite

Algorithms for Distributed Constraint Satisfaction: A Review

By Yokoo M.

Autonomous Agents and Multi-Agent Systems, Vol. 3, Iss. 2, 2000-06 ,pp. : 185-207

Springer Publishing Company

Access to resources Recommend Favorite

Benchmarking of optimisation techniques based on genetic algorithms, tabu search and simulated annealing

By Lau H.C.W. Ho G.T.S. Cheng E.N.M. Ning A. Lee C.K.M.

International Journal of Computer Applications in Technology, Vol. 28, Iss. 2-3, 2007-04 ,pp. : 209-219

Inderscience Publishers

Access to resources Recommend Favorite

Optimal and distributed algorithms for coverage hole healing in hybrid sensor networks

By Nguyen Dung T. Nguyen Nam P. Thai My T. Helal Abdelsalam

International Journal of Sensor Networks, Vol. 11, Iss. 4, 2012-06 ,pp. : 228-240

Inderscience Publishers

Access to resources Recommend Favorite

A Hybrid Dynamic Load Balancing Algorithm for Distributed Systems Using Genetic Algorithms

International Journal of Distributed Systems and Technologies (IJDST), Vol. 5, Iss. 3, 2014-07 ,pp. : 1-23

IGI Global_journal

Access to resources Recommend Favorite