This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
Syariza Abdul Rahman, Andrzej Bargiela, Edmund K. ...
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
— This paper is at the crossroad of Cognitive Psychology and AI Robotics. It reports a cross-disciplinary project concerned about implementing human heuristics within autonomous ...
Charles Tijus, Elisabetta Zibetti, V. Besson, Nico...
Hyper-heuristics are identified as the methodologies that search the space generated by a finite set of low level heuristics for solving difficult problems. One of the iterative h...