2694 search results - page 51 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
HYBRID
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
EMO
2001
Springer
15 years 2 months ago
2001
Springer
In High Dose Rate (HDR) brachytherapy the conventional dose optimization algorithms consider the multiple objectives in form of an aggregate function which combines individual obj...
ICALP
1998
Springer
15 years 1 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
ICPP
2002
IEEE
15 years 2 months ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...
IVC
2007
14 years 9 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...