1554 search results - page 212 / 311 » Parameterized Complexity and Approximation Algorithms |
117
click to vote
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
121
click to vote
SIGECOM
2005
ACM
15 years 8 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
138
click to vote
ICPP
2002
IEEE
15 years 8 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
122
click to vote
EOR
2010
15 years 3 months ago
2010
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
155
click to vote
JSAC
2006
15 years 3 months ago
2006
Abstract--Efficient near-optimal energy allocation for multimedia data transmission using multicarrier modulation is investigated. The optimal method typically relies on an iterati...