119 search results - page 8 / 24 » A relaxed approach to combinatorial problems in robustness a... |
CPAIOR
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
AUTOMATICA
2008
13 years 9 months ago
2008
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
WAOA
2007
Springer
14 years 2 months ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
ICASSP
2011
IEEE
13 years 15 days ago
2011
IEEE
Recently, robust transmit beamforming has drawn considerable attention because it can provide guaranteed receiver performance in the presence of channel state information (CSI) er...
TWC
2008
13 years 8 months ago
2008
The goal of the sensor network localization problem is to determine positions of all sensor nodes in a network given certain pairwise noisy distance measurements and some anchor no...