4498 search results - page 214 / 900 » How to Invent Functions |
153
click to vote
ACNS
2004
Springer
15 years 8 months ago
2004
Springer
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
153
click to vote
AI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
141
click to vote
CSFW
2010
IEEE
15 years 8 months ago
2010
IEEE
—Although policy compliance testing is generally treated as a binary decision problem, the evidence gathered during the trust management process can actually be used to examine t...
163
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
137
click to vote
IJHPCA
2006
15 years 4 months ago
2006
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...