3894 search results - page 118 / 779 » Approximation Algorithms for Biclustering Problems |
186
click to vote
AUSAI
2009
Springer
15 years 9 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 ...
170
click to vote
GECCO
2000
Springer
15 years 10 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 ...
170
click to vote
WSC
2008
15 years 8 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
161
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
168
click to vote
STOC
2006
ACM
16 years 10 days ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...