13841 search results - page 2436 / 2769 » Algorithms and Constraint Programming |
128
Voted
IWMM
2000
Springer
15 years 8 months ago
2000
Springer
We study the effectiveness of garbage collection (GC) algorithms by measuring the time difference between the actual collection time of an object and the potential earliest collec...
119
click to vote
ARTS
1997
Springer
15 years 8 months ago
1997
Springer
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
134
click to vote
PEPM
2000
ACM
15 years 8 months ago
2000
ACM
Many program optimisations and analyses, such as arraybound checking, termination analysis, etc, dependon knowing the size of a function's input and output. However, size inf...
123
click to vote
COCO
1995
Springer
15 years 8 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
156
click to vote
WFLP
2000
Springer
15 years 8 months ago
2000
Springer
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...