5595 search results - page 175 / 1119 » Approximation Algorithms for Clustering Problems |
107
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
159
click to vote
CCE
2004
15 years 5 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
135
Voted
ADHOCNOW
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
158
click to vote
AUSAI
2009
Springer
15 years 8 months ago
2009
Springer
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...
144
click to vote
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...