5964 search results - page 238 / 1193 » A theory of speculative computation |
237
click to vote
MST
2011
15 years 2 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
192
click to vote
CHI
1999
ACM
15 years 11 months ago
1999
ACM
The past decades have seen huge improvements in computer systems but these have proved difficult to translate into comparable improvements in the usability and social integration)...
183
click to vote
LPNMR
2005
Springer
16 years 21 days ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
166
click to vote
QCQC
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. We briefly review the development and theory of an experiment to investigate quantum computation with trapped calcium ions. The ion trap, laser and ion requirements are d...
175
click to vote
BCSHCI
2007
15 years 8 months ago
2007
The research outlined investigates strategies that nonprogramming or “everyday” users may take in interaction with a Pervasive Computing Environment within relevant domains sp...