1686 search results - page 21 / 338 » Programs as polygraphs: computability and complexity |
121
click to vote
ASPLOS
2011
ACM
14 years 1 months ago
2011
ACM
Providing deterministic execution significantly simplifies the debugging, testing, replication, and deployment of multithreaded programs. Recent work has developed deterministic...
119
click to vote
LOGCOM
2010
14 years 4 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
73
Voted
PRESENCE
2002
14 years 9 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...
101
click to vote
JMLR
2010
14 years 4 months ago
2010
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...
76
Voted
HPCC
2007
Springer
15 years 3 months ago
2007
Springer
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...