1170 search results - page 4 / 234 » How Fast Is Too Fast |
DAGSTUHL
2006
13 years 11 months ago
2006
One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...
ISSAC
1999
Springer
14 years 2 months ago
1999
Springer
In this paper we consider the problem of fast computation of n-ary products, for large n, over arbitrary precision integer or rational number domains. The combination of loop unro...
ICS
2010
Tsinghua U.
14 years 7 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
SPDP
1993
IEEE
14 years 1 months ago
1993
IEEE
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
GTTSE
2007
Springer
14 years 4 months ago
2007
Springer