4940 search results - page 289 / 988 » On the Complexity of Universal Programs |
192
click to vote
IEEEPACT
1999
IEEE
15 years 11 months ago
1999
IEEE
Automatic parallelization of general-purpose programs is still not possible in general in the presence of irregular data structures and complex control-flows. One promising strate...
240
click to vote
CPE
1994
Springer
15 years 10 months ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
166
click to vote
LOPSTR
1994
Springer
15 years 10 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
129
Voted
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Automatically assessing the value of bioavailability from the chemical structure of a molecule is a very important issue in biomedicine and pharmacology. In this paper, we present...
216
click to vote
CLIMA
2006
15 years 8 months ago
2006
We present a multi-agent formalism based on extended answer set programming. The system consists of independent agents connected via a communication channel, where knowledge and be...