1686 search results - page 46 / 338 » Programs as polygraphs: computability and complexity |
IEEEPACT
2006
IEEE
15 years 3 months ago
2006
IEEE
Modeling and analysis of program behavior are at the foundation of computer system design and optimization. As computer systems become more adaptive, their efficiency increasingly...
CIE
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
CACM
2007
14 years 9 months ago
2007
ACTION THE KEY TO COMPUTING? Why is it that some software engineers and computer scientists are able to produce clear, elegant designs and programs, while others cannot? Is it poss...
86
Voted
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...