3937 search results - page 539 / 788 » Questioning Ubiquitous Computing |
187
click to vote
STACS
2005
Springer
16 years 13 hour ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
154
click to vote
COORDINATION
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We consider the question of how to establish and enforce communal policies for peer-to-peer (P2P) communities. Generally, members of each P2P community must conform to an...
158
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
171
click to vote
PAM
2004
Springer
15 years 12 months ago
2004
Springer
Given that the global DNS system, especially at the higher root and top-levels, experiences significant query loads, we seek to answer the following questions: (1) How does the ch...
211
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...