1712 search results - page 313 / 343 » A Computational Approach to Binding Theory |
107
click to vote
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we develop a novel probabilistic model of computational trust that explicitly deals with correlated multi-dimensional contracts. Our starting point is to consider an...
115
click to vote
CIE
2007
Springer
15 years 7 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
148
click to vote
IPSN
2007
Springer
15 years 7 months ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
115
click to vote
ANCS
2006
ACM
15 years 7 months ago
2006
ACM
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
101
click to vote
SPAA
2006
ACM
15 years 7 months ago
2006
ACM
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...