1534 search results - page 33 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
JAIR
2008
13 years 7 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
SPAA
1992
ACM
13 years 11 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
CIBCB
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— This paper presents a parametric model to estimate the DNA-protein binding time using the DNA and protein structures and details of the binding site. To understand the ...
AIPS
2009
13 years 8 months ago
2009
Planning based on propositional SAT(isfiability) is a powerful approach to computing step-optimal plans given a parallel execution semantics. In this setting: (i) a solution plan ...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
If parallelism can be successfully exploited in a program, significant reductions in execution time can be achieved. However, if sections of the code are dominated by parallel ove...