65 search results - page 12 / 13 » Lower Bounds for Lucas Chains |
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Low analyzes the equilibrium performance of the recently developed eXplicit Control Protocol (XCP) by applying the derived window-based dynamical model. However, Low’s window...
GECCO
2005
Springer
14 years 25 days ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
TC
2008
13 years 7 months ago
2008
The design and performance of next-generation chip multiprocessors (CMPs) will be bound by the limited amount of power that can be dissipated on a single die. We present photonic n...
ICALP
2001
Springer
13 years 11 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
TCC
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...