Sciweavers

730 search results - page 53 / 146
» Combinatorics of Monotone Computations
Sort
View
WPES
2003
ACM
14 years 2 months ago
Hidden Credentials
Hidden Credentials are useful in situations where requests for service, credentials, access policies and resources are extremely sensitive. We show how transactions which depend o...
Jason E. Holt, Robert W. Bradshaw, Kent E. Seamons...
AAAI
2007
13 years 11 months ago
Point-Based Policy Iteration
We describe a point-based policy iteration (PBPI) algorithm for infinite-horizon POMDPs. PBPI replaces the exact policy improvement step of Hansen’s policy iteration with point...
Shihao Ji, Ronald Parr, Hui Li, Xuejun Liao, Lawre...
IS
2002
13 years 8 months ago
Pushing extrema aggregates to optimize logic queries
In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contr...
Filippo Furfaro, Sergio Greco, Sumit Ganguly, Carl...
ICONS
2009
IEEE
13 years 6 months ago
Improving the Sensitivity of Deadlines with a Specific Asynchronous Scenario for Harmonic Periodic Tasks scheduled by FP
The aim of this paper is to address the problem of correctly dimensioning real-time embedded systems. It is well known that computers which control systems are greatly affected by...
Patrick Meumeu Yomsi, Yves Sorel, D. de Rauglaudre...
COMBINATORICS
2006
162views more  COMBINATORICS 2006»
13 years 8 months ago
Bounding the Partition Function of Spin-Systems
With a graph G = (V, E) we associate a collection of non-negative real weights vV {i,v : 1 i m} uvE{ij,uv : 1 i j m}. We consider the probability distribution on {f : V {1,...
David J. Galvin