Sciweavers

422 search results - page 64 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
SAB
2010
Springer
153views Optimization» more  SAB 2010»
13 years 7 months ago
Cooperative Stigmergic Navigation in a Heterogeneous Robotic Swarm
We study self-organized cooperation in a heterogeneous robotic swarm consisting of two sub-swarms. The robots of each sub-swarm play distinct roles based on their different charac...
Frederick Ducatelle, Gianni A. Di Caro, Luca Maria...
FOCS
2005
IEEE
14 years 2 months ago
Beyond VCG: Frugality of Truthful Mechanisms
We study truthful mechanisms for auctions in which the auctioneer is trying to hire a team of agents to perform a complex task, and paying them for their work. As common in the ...
Anna R. Karlin, David Kempe, Tami Tamir
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 8 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
COR
2008
142views more  COR 2008»
13 years 8 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
VLDB
2004
ACM
187views Database» more  VLDB 2004»
14 years 1 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi