3937 search results - page 513 / 788 » Questioning Ubiquitous Computing |
182
click to vote
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
184
click to vote
SIGCSE
2010
ACM
15 years 6 months ago
2010
ACM
Applying information and communication technologies to development (ICTD) is emerging as an interesting and motivating research area in computer science and engineering. It spans ...
171
click to vote
JSYML
2007
15 years 6 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
197
click to vote
ENTCS
2002
15 years 6 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
224
click to vote
IHI
2010
15 years 1 months ago
2010
One of the concerns patients have when confronted with a medical condition is which physician to trust. Any recommendation system that seeks to answer this question must ensure an...