7150 search results - page 126 / 1430 » An Approximation Algorithm for Approximation Rank |
108
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
132
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
124
Voted
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
103
Voted
MOC
2000
15 years 2 months ago
2000
The probabilistic approach is used for constructing special layer methods to solve the Cauchy problem for semilinear parabolic equations with small parameter. Despite their probabi...
132
Voted
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...