5595 search results - page 170 / 1119 » Approximation Algorithms for Clustering Problems |
131
click to vote
SAC
2006
ACM
15 years 11 months ago
2006
ACM
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
164
Voted
ECCC
2006
15 years 5 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
180
click to vote
ASAP
2004
IEEE
15 years 8 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
156
click to vote
CDC
2010
IEEE
15 years 2 days ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
146
Voted
GECCO
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...