4843 search results - page 212 / 969 » The Shortcut Problem - Complexity and Approximation |
127
Voted
SIAMNUM
2010
14 years 10 months ago
2010
In this paper we extend the discrete duality finite volume (DDFV) formulation to the steady convection-diffusion equation. The discrete gradients defined in DDFV are used to define...
147
click to vote
JAIR
2008
15 years 3 months ago
2008
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
119
Voted
SIAMCO
2002
15 years 3 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
110
Voted
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...
104
Voted
FOCS
1996
IEEE
15 years 7 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...