355 search results - page 48 / 71 » A New Approximation Technique for Resource-Allocation Proble... |
AAAI
2004
15 years 1 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
CONSTRAINTS
2007
14 years 11 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
102
click to vote
GLOBECOM
2010
IEEE
14 years 9 months ago
2010
IEEE
Fast and accurate Carrier Frequency Offset (CFO) estimation is a problem of significance in many multi-carrier modulation based systems, especially in uplink Orthogonal Frequency D...
105
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
The 1 norm regularized least square technique has been proposed as an efficient method to calculate sparse solutions. However, the choice of the regularization parameter is still...
114
click to vote
SODA
2003
ACM
15 years 1 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...