Sciweavers

9572 search results - page 26 / 1915
» Cover Algorithms and Their Combination
Sort
View
ESA
2006
Springer
88views Algorithms» more  ESA 2006»
13 years 11 months ago
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
Christoph Ambühl, Monaldo Mastrolilli
APPROX
2008
Springer
173views Algorithms» more  APPROX 2008»
13 years 9 months ago
Connected Vertex Covers in Dense Graphs
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
Jean Cardinal, Eythan Levy
ICGI
2010
Springer
13 years 8 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik
PDCN
2004
13 years 9 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
AICCSA
2007
IEEE
110views Hardware» more  AICCSA 2007»
14 years 1 months ago
Benchmarking XML-Schema Matching Algorithms for Improving Automated Tuning
Several matching algorithms were recently developed in order to automate or semi-automate the process of correspondences discovery between XML schemas. These algorithms use a wide...
Mohamed Boukhebouze, Rami Rifaieh, Aïcha-Nabi...