1686 search results - page 60 / 338 » Programs as polygraphs: computability and complexity |
GRID
2004
Springer
15 years 3 months ago
2004
Springer
Allowing loose coupling between complex e-Science applications has many advantages, such as being able to easily incorporate new applications and to flexibly specify how the appl...
ICS
2009
Tsinghua U.
15 years 4 months ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
BIRTHDAY
2003
Springer
15 years 3 months ago
2003
Springer
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
117
click to vote
UPP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
LISP
2008
14 years 9 months ago
2008
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...