1169 search results - page 165 / 234 » Degrees of monotone complexity |
IEEEPACT
2002
IEEE
14 years 2 months ago
2002
IEEE
Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time withou...
IV
2002
IEEE
14 years 2 months ago
2002
IEEE
Robots are employed to do exacting routines, ranging from the common place to the difficult and from the relatively safe to the highly dangerous. Remote-controlled robots -or tele...
SPAA
2010
ACM
14 years 2 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...