3937 search results - page 157 / 788 » Questioning Ubiquitous Computing |
144
Voted
DAGSTUHL
2007
15 years 4 months ago
2007
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
115
Voted
ORDER
2007
15 years 2 months ago
2007
Abstract. We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results....
121
Voted
TOC
2010
14 years 9 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
104
Voted
SIGCSE
1995
ACM
15 years 6 months ago
1995
ACM
Students get more out of an interactive lecture than a passive lecture because they are given time to think. This time allows them to determine if they understand a concept, and i...
116
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...