2080 search results - page 1 / 416 » Measuring empirical computational complexity |
SIGSOFT
2007
ACM
14 years 5 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Genetic representations that do not employ a one-to-one mapping of genotype to phenotype are known as indirect encodings, and can be much more efficient than direct encodings for ...
MICRO
2003
IEEE
13 years 10 months ago
2003
IEEE
With power dissipation becoming an increasingly vexing problem across many classes of computer systems, measuring power dissipation of real, running systems has become crucial for...
SLIP
2003
ACM
13 years 10 months ago
2003
ACM
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
BMCBI
2007
13 years 5 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...