2957 search results - page 350 / 592 » The Complexity of Polynomial-Time Approximation |
123
click to vote
ANNALS
2006
15 years 6 months ago
2006
This paper describes an interactive simulation of the Electronical Numerical Integrator and Computer (ENIAC). With the simulator, the user can wire up complex configurations of th...
171
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that t...
164
click to vote
TCAD
2008
15 years 6 months ago
2008
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
198
click to vote
NETWORKS
2010
15 years 5 months ago
2010
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
177
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...