1477 search results - page 71 / 296 » Complexity of (iterated) dominance |
187
click to vote
SIAMCOMP
2010
15 years 28 days ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
147
click to vote
ASPDAC
2006
ACM
16 years 5 days ago
2006
ACM
Statistical timing analysis has been widely applied to predict the timing yield of VLSI circuits when process variations become significant. Existing statistical latch timing met...
164
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we consider the optimal rate and power allocation that maximizes a general utility function of average user rates in a fading multiple-access or broadcast channel. B...
164
click to vote
UAI
2008
15 years 7 months ago
2008
Bounded policy iteration is an approach to solving infinitehorizon POMDPs that represents policies as stochastic finitestate controllers and iteratively improves a controller by a...
147
click to vote
IJCAI
1989
15 years 7 months ago
1989
A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance. In [Dean and Boddy, 1988], we define a framework for constru...