Sciweavers

14774 search results - page 437 / 2955
» Computational complexity and evolutionary computation
Sort
View
ESA
2008
Springer
106views Algorithms» more  ESA 2008»
15 years 8 months ago
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
Seung-Jin Sul, Tiffani L. Williams
ICS
2010
Tsinghua U.
16 years 4 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
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 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
164
Voted
ARITH
2003
IEEE
16 years 3 days ago
On-Line Multiplication in Real and Complex Base
Multiplication of two numbers represented in base   is shown to be computable by an on-line algorithm when   is a negative integer, a positive non-integer real number, or a comp...
Christiane Frougny, Athasit Surarerks
CHI
2010
ACM
15 years 10 months ago
Sawtooth: interactive clarity and aesthetic complexity
Sawtooth (2009) is an artwork integrating performance, sound, and animation. This paper describes the design of Sawtooth, with particular reference to the balances it strikes betw...
Christopher Burns
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
16 years 10 days ago
Parameterized versus generative representations in structural design: an empirical comparison
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...
Rafal Kicinger, Tomasz Arciszewski, Kenneth A. De ...