Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
: In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven pur...
In this paper, we argue that allowing self-interested agents to activate social institutions during run-time can improve the robustness (i.e., stability, cooperation or fairness) ...
It has been established that active learning is effective for learning complex, subjective query concepts for image retrieval. However, active learning has been applied in a conc...
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...