Sciweavers

9176 search results - page 517 / 1836
» algorithms 2010
Sort
View
PPSN
2010
Springer
15 years 5 months ago
Optimisation and Generalisation: Footprints in Instance Space
Abstract. The chief purpose of research in optimisation is to understand how to design (or choose) the most suitable algorithm for a given distribution of problem instances. Ideall...
David W. Corne, Alan P. Reynolds
PVLDB
2010
225views more  PVLDB 2010»
15 years 1 months ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
ALGORITHMS
2010
113views more  ALGORITHMS 2010»
15 years 4 months ago
A Complete Theory of Everything (Will Be Subjective)
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
Marcus Hutter
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
16 years 4 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu
STACS
2010
Springer
16 years 1 months ago
Treewidth Reduction for Constrained Separation and Bipartization Problems
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
Dániel Marx, Barry O'Sullivan, Igor Razgon