1161 search results - page 91 / 233 » Approximation schemes for clustering problems |
SAC
2006
ACM
15 years 5 months ago
2006
ACM
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
101
click to vote
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
ICCAD
1997
IEEE
15 years 4 months ago
1997
IEEE
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...