5230 search results - page 204 / 1046 » Dynamic Optimality -- Almost |
101
click to vote
PERCOM
2009
ACM
16 years 4 months ago
2009
ACM
In pervasive computing environments, applications find themselves in constantly changing operating conditions. Such applications often need to discover locally available resources ...
117
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Almost every application of spreading activation is accompanied by its own set of often heuristic restrictions on the dynamics. We show that in constraint-free scenarios spreading...
149
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...
142
click to vote
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We describe a consistent splitting approach to the pressurestabilized Petrov-Galerkin finite element method for incompressible flow. The splitting leads to (almost) exp...
111
click to vote
GG
2004
Springer
15 years 9 months ago
2004
Springer
There would seem to be a natural connection between graphs and information security. This is particularly so in the arena of access control and authorization. Research on applying ...