4940 search results - page 57 / 988 » On the Complexity of Universal Programs |
139
click to vote
SIGPLAN
2002
15 years 3 months ago
2002
This paper describes a course in hardware description and synthesis (hardware compilation), taught as an introductory graduate course at Chalmers University of Technology, and as a...
244
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
132
Voted
CASES
2001
ACM
15 years 7 months ago
2001
ACM
Current development tools for embedded real-time systems do not efficiently support the timing aspect. The most important timing parameter for scheduling and system analysis is th...
155
click to vote
KBSE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—Test coverage such as branch coverage is commonly measured to assess the sufficiency of test inputs. To reduce tedious manual efforts in generating high-covering test i...
121
Voted
FPCA
1989
15 years 8 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...