350 search results - page 25 / 70 » Lower bounds and heuristic algorithms for the k |
PODC
2010
ACM
14 years 11 days ago
2010
ACM
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
FOCS
2008
IEEE
14 years 2 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. â€...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
JDA
2008
13 years 8 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...