3946 search results - page 297 / 790 » The computational complexity of choice sets |
177
click to vote
IPL
2007
15 years 6 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
169
click to vote
DC
2000
15 years 6 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
183
click to vote
EUROPAR
2005
Springer
16 years 9 days ago
2005
Springer
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
182
click to vote
COLT
2004
Springer
15 years 10 months ago
2004
Springer
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
139
click to vote
TCBB
2008
15 years 6 months ago
2008
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...