361 search results - page 52 / 73 » Approximate counting by dynamic programming |
PPOPP
2010
ACM
13 years 6 months ago
2010
ACM
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
LATIN
2010
Springer
14 years 19 days ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
CAD
2011
Springer
12 years 11 months ago
2011
Springer
Design using free-form developable surfaces plays an important role in manufacturing industry. Currently most commercial systems can only support converting free-form surfaces int...
AIPS
2009
13 years 8 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...