3874 search results - page 163 / 775 » Approximation Algorithms for k-hurdle Problems |
122
Voted
MST
2007
15 years 1 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
CIG
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract- In this paper, we apply an Evolutionary Algorithm (EA) to solve the Rubinstein’s Basic AlternatingOffer Bargaining Problem, and compare our experimental results with it...
108
Voted
ISSAC
2009
Springer
15 years 8 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
117
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
116
Voted
CPM
2008
Springer
15 years 3 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...