6315 search results - page 197 / 1263 » Approximating Solution Structure |
139
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
179
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
207
click to vote
ILP
2004
Springer
15 years 12 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
177
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
197
click to vote
AIMSA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...