Sciweavers

1236 search results - page 37 / 248
» Efficient Interpretation Policies
Sort
View
ICML
2005
IEEE
14 years 9 months ago
A theoretical analysis of Model-Based Interval Estimation
Several algorithms for learning near-optimal policies in Markov Decision Processes have been analyzed and proven efficient. Empirical results have suggested that Model-based Inter...
Alexander L. Strehl, Michael L. Littman
DEXA
2003
Springer
162views Database» more  DEXA 2003»
14 years 2 months ago
Dynamic Splitting Policies of the Adaptive 3DR-Tree for Indexing Continuously Moving Objects
Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple exte...
Bonggi Jun, Bonghee Hong, Byunggu Yu
CONCUR
2001
Springer
14 years 1 months ago
Reasoning about Security in Mobile Ambients
The paper gives an assessment of security for Mobile Ambients, with specific focus on mandatory access control (MAC) policies in multilevel security systems. The first part of th...
Michele Bugliesi, Giuseppe Castagna, Silvia Crafa
CORR
2007
Springer
114views Education» more  CORR 2007»
13 years 8 months ago
Opportunistic Communications in an Orthogonal Multiaccess Relay Channel
— The problem of resource allocation is studied for a two-user fading orthogonal multiaccess relay channel (MARC) where both users (sources) communicate with a destination in the...
Lalitha Sankar, Yingbin Liang, H. Vincent Poor, Na...
CF
2008
ACM
13 years 10 months ago
A distributed evolutionary method to design scheduling policies for volunteer computing
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
Trilce Estrada, Olac Fuentes, Michela Taufer