3663 search results - page 158 / 733 » Problems in the ontology of computer programs |
143
click to vote
CASES
2009
ACM
15 years 2 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
130
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Genetic Programming (GP) is an automated computational programming methodology, inspired by the workings of natural evolution techniques. It has been applied to solve complex prob...
133
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
192
click to vote
CPM
1998
Springer
15 years 9 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
130
click to vote
DATE
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we propose two FPGA-area allocation algorithms based on profiling results for reducing the impact on performance of dynamic reconfiguration overheads. The problem o...