4940 search results - page 666 / 988 » On the Complexity of Universal Programs |
217
click to vote
ECRTS
2007
IEEE
16 years 1 months ago
2007
IEEE
Many embedded systems feature processors coupled with a small and fast scratchpad memory. To the difference with caches, allocation of data to scratchpad memory must be handled by...
148
click to vote
CAV
2007
Springer
16 years 25 days ago
2007
Springer
We propose a shape analysis that adapts to some of the complex composite data structures found in industrial systems-level programs. Examples of such data structures include “cyc...
201
click to vote
CP
2007
Springer
16 years 25 days ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
207
click to vote
EUROPAR
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Prefetching transfers a data item in advance from its storage location to its usage location so that communication is hidden and does not delay computation. We present a ...
166
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
Tournament selection has been widely used and studied in evolutionary algorithms. To supplement the study of tournament selection, this paper provides several models describing th...