Sciweavers

4940 search results - page 97 / 988
» On the Complexity of Universal Programs
Sort
View
CPHYSICS
2006
119views more  CPHYSICS 2006»
15 years 4 months ago
GDF: A tool for function estimation through grammatical evolution
This article introduces a tool for data fitting that is based on genetic programming and especially on the grammatical evolution technique. The user needs to input a series of poi...
Ioannis G. Tsoulos, Dimitris Gavrilis, Evangelos D...
ICSE
2009
IEEE-ACM
15 years 11 months ago
WISE: Automated test generation for worst-case complexity
Program analysis and automated test generation have primarily been used to find correctness bugs. We present complexity testing, a novel automated test generation technique to ...
Jacob Burnim, Sudeep Juvekar, Koushik Sen
CEC
2009
IEEE
15 years 11 months ago
The engineering of concurrent simulations of complex systems
— Concurrent process-oriented programming is a natural medium for simulating complex systems, particularly systems where many simple components interact in an environment (which ...
Fiona A. C. Polack, Paul S. Andrews, Adam T. Samps...
COCO
2005
Springer
80views Algorithms» more  COCO 2005»
15 years 10 months ago
New Results on the Complexity of the Middle Bit of Multiplication
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
Ingo Wegener, Philipp Woelfel
ATAL
2004
Springer
15 years 10 months ago
The Insufficiency of Formal Design Methods - The Necessity of an Experimental Approach - for the Understanding and Control of Co
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
Bruce Edmonds, Joanna Bryson