13603 search results - page 224 / 2721 » On the Computational Complexity of Cut-Reduction |
183
click to vote
PRESENCE
2002
15 years 6 months ago
2002
"It / I" is a two-character theater play where the human character I (played by a real actor) is taunted and played with by an autonomous computer character It on a comp...
167
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...
178
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
203
click to vote
DSVIS
2006
Springer
15 years 10 months ago
2006
Springer
The development of video games is a complex software engineering activity bringing together large multidisciplinary teams under stringent constraints. While much has been written a...
152
click to vote
ESANN
2007
15 years 8 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...