779 search results - page 66 / 156 » Algorithms for the Sample Mean of Graphs |
150
click to vote
IEEEPACT
2000
IEEE
15 years 8 months ago
2000
IEEE
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
157
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
124
click to vote
DAC
2007
ACM
16 years 5 months ago
2007
ACM
A key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks...
124
click to vote
TVLSI
2002
15 years 4 months ago
2002
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
122
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...