Sciweavers

16188 search results - page 2933 / 3238
» The Optimal PAC Algorithm
Sort
View
ROBOCUP
2005
Springer
108views Robotics» more  ROBOCUP 2005»
16 years 3 days ago
Successful Search and Rescue in Simulated Disaster Areas
RoboCupRescue Simulation is a large-scale multi-agent simulation of urban disasters where, in order to save lives and minimize damage, rescue teams must effectively cooperate despi...
Alexander Kleiner, Michael Brenner, Tobias Brä...
SSD
2005
Springer
153views Database» more  SSD 2005»
16 years 2 days 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...
VLDB
2005
ACM
129views Database» more  VLDB 2005»
16 years 2 days ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
VLDB
2005
ACM
125views Database» more  VLDB 2005»
16 years 2 days ago
Rewriting XPath Queries Using Materialized Views
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
Wanhong Xu, Z. Meral Özsoyoglu
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
16 years 2 days ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
« Prev « First page 2933 / 3238 Last » Next »