3894 search results - page 171 / 779 » Approximation Algorithms for Biclustering Problems |
140
click to vote
IPL
2008
15 years 6 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
180
click to vote
MST
2007
15 years 6 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 ...
152
click to vote
CIG
2005
IEEE
16 years 3 days 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...
164
click to vote
ISSAC
2009
Springer
16 years 1 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...
167
click to vote
GECCO
2008
Springer
15 years 7 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...