4744 search results - page 24 / 949 » Connected Computing |
AAAI
2012
11 years 10 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
BROADNETS
2006
IEEE
14 years 2 months ago
2006
IEEE
— In this paper, we study coverage with connectivity properties in large wireless sensor networks. We consider three classes: full coverage with connectivity, partial coverage wi...
WG
2000
Springer
14 years 7 hour ago
2000
Springer
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
SPAA
2000
ACM
14 years 11 hour ago
2000
ACM
Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wide web. They extensively studied uniform connection caching, where the establishment...
ITICSE
2003
ACM
14 years 1 months ago
2003
ACM
Changing conditions for teaching increase our motivation to understand the teaching and learning process. First time investigators of educational settings often feel uncertain abo...