We revisit the noisy binary search model of [10], in which we have n coins with unknown probabilities pi that we can flip. The coins are sorted by increasing pi, and we would like to find where the probability crosses...
详细信息
作者：
Kalgin, K. V.Russian Acad Sci
Inst Comp Math & Math Geophys Siberian Branch Pr Akad Lavrenteva 6 Novosibirsk 630090 Russia
The efficiency of implementations of algorithms with a fine-grained parallelism onGPUs that support the CUDA architecture is studied. Cellular automata and difference schemes are used for testing. Several versions of ...
详细信息
The efficiency of implementations of algorithms with a fine-grained parallelism onGPUs that support the CUDA architecture is studied. Cellular automata and difference schemes are used for testing. Several versions of implementations are proposed and their efficiency is analyzed. An example of GPU application for modeling the process of carbon dioxide oxidation on the catalyst surface is given.
暂无评论