Sciweavers

1686 search results - page 104 / 338
» Programs as polygraphs: computability and complexity
Sort
View
WWW
2008
ACM
15 years 10 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen
WOSP
1998
ACM
15 years 2 months ago
Poems: end-to-end performance design of large parallel adaptive computational systems
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
Ewa Deelman, Aditya Dube, Adolfy Hoisie, Yong Luo,...
ERSHOV
2003
Springer
15 years 3 months ago
The Translation Power of the Futamura Projections
Despite practical successes with the Futamura projections, it has been an open question whether target programs produced by specializing interpreters can always be as efficient as ...
Robert Glück
EH
2004
IEEE
125views Hardware» more  EH 2004»
15 years 1 months ago
Routine High-Return Human-Competitive Evolvable Hardware
This paper reviews the use of genetic programming as an automated invention machine for the synthesis of both the topology and sizing of analog electrical circuits. The paper focu...
John R. Koza, Martin A. Keane, Matthew J. Streeter
APSEC
2001
IEEE
15 years 1 months ago
Compilation of Specifications
Computer software now controls critical systems worldwide. International standards require such programs to be produced from mathematically-precise specifications, but the techniq...
Colin J. Fidge