Sciweavers

1449 search results - page 97 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
FUIN
2010
143views more  FUIN 2010»
15 years 3 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
IJRR
2010
115views more  IJRR 2010»
15 years 3 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
ICALP
2011
Springer
14 years 9 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
ICDE
2012
IEEE
267views Database» more  ICDE 2012»
13 years 8 months ago
Scalable and Numerically Stable Descriptive Statistics in SystemML
—With the exponential growth in the amount of data that is being generated in recent years, there is a pressing need for applying machine learning algorithms to large data sets. ...
Yuanyuan Tian, Shirish Tatikonda, Berthold Reinwal...
ADBIS
1998
Springer
100views Database» more  ADBIS 1998»
15 years 10 months ago
Multiple Range Query Optimization in Spatial Databases
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Apostolos Papadopoulos, Yannis Manolopoulos