844 search results - page 37 / 169 » Solving the p |
126
click to vote
FOCS
2008
IEEE
15 years 12 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
123
click to vote
PAIRING
2007
Springer
15 years 11 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
165
click to vote
ICML
2006
IEEE
16 years 6 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
113
click to vote
EOR
2007
15 years 5 months ago
2007
In this paper, we suggest a parallel algorithm based on a shared memory SIMD architecture for solving an n item subset-sum problem in time O(2n/2 /p) by using p = 2q processors, 0...
247
click to vote
MEMBRANE
2005
Springer
15 years 11 months ago
2005
Springer
In the present paper we propose a way to simulate Boolean gates and circuits in the framework of P systems with active membranes using inhibiting/de-inhibiting rules. This new appr...