447 search results - page 42 / 90 » Approximation Algorithms for Directed Steiner Problems |
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
ICIP
2000
IEEE
14 years 10 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
CORR
2011
Springer
13 years 2 days ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
WADS
2007
Springer
14 years 2 months ago
2007
Springer
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...
NIPS
2007
13 years 10 months ago
2007
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...