Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
This paper presents the planning system Pdk (Planning with Domain Knowledge), based on the translation of planning problems into Linear Time Logic theories, in such a way that fin...
Marta Cialdea Mayer, Carla Limongelli, Andrea Orla...
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
We have developed a new tool for virtual database screening. This tool, referred to as the Generic Evolutionary Method for molecular DOCKing (GEMDOCK), combines an evolutionary app...