3874 search results - page 93 / 775 » Approximation Algorithms for k-hurdle Problems |
113
click to vote
PODS
2007
ACM
15 years 10 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
CIAC
2010
Springer
15 years 2 months ago
2010
Springer
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...
EVOW
2006
Springer
15 years 1 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...