3937 search results - page 686 / 788 » Questioning Ubiquitous Computing |
121
Voted
MOBIHOC
2006
ACM
16 years 1 months ago
2006
ACM
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
105
Voted
DCC
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
128
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
123
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
86
Voted
ITICSE
2006
ACM
15 years 8 months ago
2006
ACM
Identifying and managing students who experience difficulty with learning to program is a challenge for CS educators. In an attempt to answer the familiar question “What makes f...