1445 search results - page 149 / 289 » Uniformly Hard Languages |
122
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
139
Voted
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
121
click to vote
SIGOPSE
2004
ACM
15 years 9 months ago
2004
ACM
The architecture of an operating system, e.g. micro kernel or monolithic kernel, is usually seen as something static. Even during the long lasting evolution of operating system co...
114
Voted
ICALT
2003
IEEE
15 years 9 months ago
2003
IEEE
Algorithms and Programming Languages is a core subject in the BS Degree in Mathematics at the authors’ university. Some of the students are very interested in computer programmi...
113
click to vote
WORDS
2003
IEEE
15 years 9 months ago
2003
IEEE
Timing analysis is a crucial test for dependable hard real-time systems (DHRTS). The calculation of the worst-case execution time (WCET) is mandatory. As modern compilers are capa...