Sciweavers

4702 search results - page 255 / 941
» How to Copyright a Function
Sort
View
AI
2006
Springer
15 years 9 months ago
Belief Selection in Point-Based Planning Algorithms for POMDPs
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
Masoumeh T. Izadi, Doina Precup, Danielle Azar
CSFW
2010
IEEE
15 years 9 months ago
Towards Quantitative Analysis of Proofs of Authorization: Applications, Framework, and Techniques
—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...
Adam J. Lee, Ting Yu
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 6 months ago
Locating phase transitions in computationally hard problems
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...
B. Ashok, T. K. Patra
IJHPCA
2006
109views more  IJHPCA 2006»
15 years 6 months ago
A Resource Leasing Policy for on-Demand Computing
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...
Darin England, Jon B. Weissman
IPM
2000
108views more  IPM 2000»
15 years 5 months ago
A system for supporting cross-lingual information retrieval
In this paper, we present the system MULINEX, a fully implemented system which supports cross-lingual search of the WWW. Users can formulate, expand and disambiguate queries, filt...
Joanne Capstick, Abdel Kader Diagne, Gregor Erbach...