1054 search results - page 79 / 211 » Capacitated Domination Problem |
111
click to vote
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
104
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
105
click to vote
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
110
click to vote
ICCAD
2006
IEEE
15 years 12 months ago
2006
IEEE
Process variations cause different behavior of timingdependent effects across different chips. In this work, we analyze one example of timing-dependent effects, crosscoupling ...
159
click to vote
ISPD
1997
ACM
15 years 7 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...