6274 search results - page 1126 / 1255 » From query complexity to computational complexity |
164
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
134
click to vote
DSN
2004
IEEE
15 years 8 months ago
2004
IEEE
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
145
click to vote
EMSOFT
2006
Springer
15 years 8 months ago
2006
Springer
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...
119
click to vote
NOSSDAV
1991
Springer
15 years 8 months ago
1991
Springer
One of the most important emerging developments for improving the user/computer interface has been the addition of multimedia facilities to high-performance workstations. Although...
139
click to vote
FAST
2008
15 years 6 months ago
2008
Ever-increasing complexity of large-scale applications and continuous increases in sizes of the data they process make the problem of maximizing performance of such applications a...