1546 search results - page 243 / 310 » Context-Aware Computing with Sound |
141
click to vote
AAAI
2006
15 years 6 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
126
click to vote
CIE
2007
Springer
15 years 4 months ago
2007
Springer
Closed captioning has been enabling access to television for people who are deaf and hard of hearing since the early 1970s. Since that time, technology and people’s demands have...
136
Voted
JFP
2008
15 years 4 months ago
2008
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
140
click to vote
ECCC
2000
15 years 4 months ago
2000
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...
114
Voted
CMOT
1998
15 years 4 months ago
1998
A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of it...