Sciweavers

1717 search results - page 12 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
SPAA
1996
ACM
14 years 17 days ago
An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
Robert D. Blumofe, Matteo Frigo, Christopher F. Jo...
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
ECCC
2006
75views more  ECCC 2006»
13 years 8 months ago
Note on MAX 2SAT
In this note we present an approximation algorithm for MAX 2SAT that given a (1 - ) satisfiable instance finds an assignment of variables satisfying a 1 - O( ) fraction of all co...
Moses Charikar, Konstantin Makarychev, Yury Makary...
HYBRID
2007
Springer
14 years 8 days ago
MARCO: A Reachability Algorithm for Multi-affine Systems with Applications to Biological Systems
We present a new algorithm for the reachability analysis of multi-affine hybrid systems. In our previous work on reachability analysis and that of our collaborators [1
Spring Berman, Ádám M. Halász...
EUROCRYPT
1999
Springer
14 years 21 days ago
An Analysis of Exponentiation Based on Formal Languages
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
Luke O'Connor