Sciweavers

1486 search results - page 154 / 298
» Algorithms for two-box covering
Sort
View
STACS
2009
Springer
15 years 11 months ago
On Approximating Multi-Criteria TSP
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
Bodo Manthey
COLT
1997
Springer
15 years 8 months ago
General Convergence Results for Linear Discriminant Updates
The problem of learning linear discriminant concepts can be solved by various mistake-driven update procedures, including the Winnow family of algorithms and the well-known Percep...
Adam J. Grove, Nick Littlestone, Dale Schuurmans
ICDE
2005
IEEE
160views Database» more  ICDE 2005»
16 years 5 months ago
Evaluation of Spatio-Temporal Predicates on Moving Objects
Moving objects databases managing spatial objects with continuously changing position and extent over time have recently found large interest in the database community. Queries ab...
Markus Schneider
ICDE
2000
IEEE
95views Database» more  ICDE 2000»
16 years 5 months ago
Dynamic Histograms: Capturing Evolving Data Sets
In this paper, we introduce dynamic histograms, which are constructed and maintained incrementally. We develop several dynamic histogram construction algorithms and show that they...
Donko Donjerkovic, Yannis E. Ioannidis, Raghu Rama...
EVOW
2009
Springer
15 years 11 months ago
Improving Performance in Combinatorial Optimisation Using Averaging and Clustering
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...
Mohamed Qasem, Adam Prügel-Bennett