4 search results - page 1 / 1 » tapas 2011 |
TAPAS
2011
13 years 1 months ago
2011
TAPAS
2011
13 years 1 months ago
2011
We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-un...
TAPAS
2011
13 years 1 months ago
2011
Abstract. We consider energy-performance tradeoff for scheduling parallel jobs on multiprocessors using dynamic speed scaling. The objective is to minimize the sum of energy consu...
TAPAS
2011
13 years 1 months ago
2011
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...