7006 search results - page 44 / 1402 » Approximation Algorithms |
105
click to vote
TAMC
2007
Springer
15 years 6 months ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
120
click to vote
ML
2007
ACM
14 years 11 months ago
2007
ACM
We propose a general-purpose stochastic optimization algorithm, the so-called annealing stochastic approximation Monte Carlo (ASAMC) algorithm, for neural network training. ASAMC c...
DFG
2009
Springer
15 years 6 months ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...