This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
The popularity of collaborative tagging sites presents a unique opportunity to explore keyword search in a context where query results are determined by the opinion of a network o...
Sihem Amer-Yahia, Michael Benedikt, Laks V. S. Lak...
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
The multi-agent resource allocation problem is the negotiation of a set of resources among a population of agents, in order to maximize a social welfare function. The purpose of th...
Antoine Nongaillard, Philippe Mathieu, Brigitte Ja...