Sciweavers

16404 search results - page 754 / 3281
» A set coverage problem
Sort
View
CCCG
2010
15 years 9 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
194
Voted
CLASSIFICATION
2006
103views more  CLASSIFICATION 2006»
15 years 7 months ago
On the Complexity of Ordinal Clustering
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
Rahul Shah, Martin Farach-Colton
IJHIS
2008
84views more  IJHIS 2008»
15 years 7 months ago
Selective generation of training examples in active meta-learning
Meta-Learning has been successfully applied to acquire knowledge used to support the selection of learning algorithms. Each training example in Meta-Learning (i.e. each meta-exampl...
Ricardo Bastos Cavalcante Prudêncio, Teresa ...
AMAI
2005
Springer
15 years 7 months ago
A SAT approach to query optimization in mediator systems
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
Steven David Prestwich, Stéphane Bressan
JSW
2007
123views more  JSW 2007»
15 years 7 months ago
A Taxonomy for a Constructive Approach to Software Evolution
Abstract— In many software design and evaluation techniques, either the software evolution problem is not systematically elaborated, or only the impact of evolution is considered...
Selim Ciraci, Pim van den Broek, Mehmet Aksit