Abstract
This paper presents new approaches for maximal constraint satisfaction problems (Max-CSPs). Inspired by the honey- bee marriage process, our approaches try to reach a solution that satisfies as many constraints as possible in a reasonable period of time. Our approaches are a centralized and distributed honey-bee optimization enhanced by a new parameter called local optimum detector. The latter allows detection of the local optimum. In this paper, newer algorithms and their experimental results are presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Knowledge-based and Intelligent Engineering Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
