2542 search results - page 47 / 509 » Computing Cartograms with Optimal Complexity |
RTA
2009
Springer
14 years 2 months ago
2009
Springer
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
EH
2005
IEEE
14 years 1 months ago
2005
IEEE
The Evolvable Computation Group, at NASA’s Jet Propulsion Laboratory, is tasked with demonstrating the utility of computational engineering and computer optimized design for com...