21 search results - page 4 / 5 » On the Average Running Time of Odd-Even Merge Sort |
SCP
2010
13 years 2 months ago
2010
In several Java VMs, strings consist of two separate objects: metadata such as the string length are stored in the actual string object, while the string characters are stored in ...
SPAA
1997
ACM
13 years 11 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
GLVLSI
2009
IEEE
13 years 11 months ago
2009
IEEE
Recent technology mappers for LUT based FPGAs employ cut enumeration. Although many cuts are often needed to nd good network, enumerating all cuts with large size consumes run-tim...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
SAS
1999
Springer
13 years 11 months ago
1999
Springer
Programs represented in Static Single Assignment (SSA) form contain phi instructions (or functions) whose operational semantics are to merge values coming from distinct control flo...