3937 search results - page 672 / 788 » Questioning Ubiquitous Computing |
MP
2007
13 years 7 months ago
2007
The question of nonemptiness of the intersection of a nested sequence of closed sets is fundamental in a number of important optimization topics, including the existence of optima...
DM
2008
13 years 6 months ago
2008
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
FUIN
2010
13 years 6 months ago
2010
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
SAMOS
2010
Springer
13 years 6 months ago
2010
Springer
—Process Networks (PNs) is an appealing computation ion helping to specify an application in parallel form and realize it on parallel platforms. The key questions to be answered ...