1686 search results - page 188 / 338 » Programs as polygraphs: computability and complexity |
128
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
116
Voted
SIGCSE
2004
ACM
15 years 9 months ago
2004
ACM
An important question that must be addressed in a coherent computing curriculum is which programming environments to use across the curriculum. For Java, currently the most widely...
131
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
As computing systems of all types grow in power and complexity, it is common to want to simultaneously execute processes with different timeliness constraints. Many systems use CP...
146
click to vote
NCA
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the ...
210
click to vote
CONPAR
1994
15 years 8 months ago
1994
The Rewrite Rule Machine (RRM) is a massively parallel MIMD/SIMD computer designed with the explicit purpose of supporting veryhigh-level parallel programming with rewrite rules. T...