447 search results - page 51 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
140
click to vote
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
132
Voted
TPDS
2008
15 years 3 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
110
Voted
COLT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
106
click to vote
WINET
2008
15 years 3 months ago
2008
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
157
click to vote
CGO
2011
IEEE
14 years 7 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...