Sciweavers

444 search results - page 73 / 89
» Instance optimal query processing in spatial networks
Sort
View
SSD
2005
Springer
153views Database» more  SSD 2005»
14 years 1 months ago
Constrained Shortest Path Computation
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...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
IPPS
2005
IEEE
14 years 1 months ago
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems
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...
Thomas Fischer, Peter Merz
PVLDB
2008
77views more  PVLDB 2008»
13 years 7 months ago
Efficient network aware search in collaborative tagging sites
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...
JMLR
2010
140views more  JMLR 2010»
13 years 2 months ago
Mean Field Variational Approximation for Continuous-Time Bayesian Networks
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman
PAAMS
2009
Springer
14 years 15 days ago
A Realistic Approach to Solve the Nash Welfare
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...