Sciweavers

901 search results - page 148 / 181
» Analyzing linear mergers
Sort
View
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
15 years 10 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 8 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
IROS
2009
IEEE
185views Robotics» more  IROS 2009»
15 years 5 months ago
Scalable and convergent multi-robot passive and active sensing
— A major barrier preventing the wide employment of mobile networks of robots in tasks such as exploration, mapping, surveillance, and environmental monitoring is the lack of efï...
Elias B. Kosmatopoulos, Lefteris Doitsidis, Konsta...
CEC
2007
IEEE
15 years 5 months ago
Target shape design optimization by evolving splines
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...
STACS
2005
Springer
15 years 4 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney