3874 search results - page 110 / 775 » Approximation Algorithms for k-hurdle Problems |
ADHOCNOW
2008
Springer
15 years 4 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...
GECCO
2000
Springer
15 years 1 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 ...
WSC
2008
15 years 7 days 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...
COCOA
2009
Springer
15 years 1 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
APPROX
2008
Springer
14 years 12 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...