3328 search results - page 457 / 666 » On Plateaued Functions and Their Constructions |
181
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
199
click to vote
KBSE
1998
IEEE
15 years 11 months ago
1998
IEEE
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...
183
click to vote
CODES
2006
IEEE
15 years 10 months ago
2006
IEEE
Simulating chip-multiprocessor systems (CMP) can take a long time. For single-threaded workloads, earlier work has shown the utility of phase analysis, that is identification of r...
178
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
215
click to vote
FPCA
1995
15 years 10 months ago
1995
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...