2714 search results - page 23 / 543 » Approximation Schemes for Scheduling |
107
Voted
APPT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. With more cores integrated into one single chip, the overall power consumption from the multiple concurrent running programs increases dramatically in a CMP processor whi...
106
click to vote
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
FCT
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. It is proved that everywhere-dense Min 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.
87
Voted
IADIS
2004
15 years 1 months ago
2004
An event is a short and data-rich document and it refers to an instance of an announcement type such as "wedding", "birth", "graduation", "aucti...
132
Voted
IPCO
2008
15 years 1 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...