Sciweavers

1524 search results - page 69 / 305
» Computing effective communication policies in multiagent sys...
Sort
View
ISCC
2000
IEEE
104views Communications» more  ISCC 2000»
15 years 10 months ago
Dynamic Routing and Wavelength Assignment Using First Policy Iteration
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
Esa Hyytiä, Jorma T. Virtamo
INFOCOM
2008
IEEE
16 years 16 days ago
Firewall Compressor: An Algorithm for Minimizing Firewall Policies
—A firewall is a security guard placed between a private network and the outside Internet that monitors all incoming and outgoing packets. The function of a firewall is to exam...
Alex X. Liu, Eric Torng, Chad R. Meiners
ATAL
2006
Springer
15 years 10 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
190
Voted
SACMAT
2006
ACM
16 years 2 days ago
The secondary and approximate authorization model and its application to Bell-LaPadula policies
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
Jason Crampton, Wing Leung, Konstantin Beznosov
148
Voted
CSCWD
2005
Springer
15 years 11 months ago
Supporting peer-to-peer collaboration through trust
Distributed systems generally require their component parts to interact cooperatively, in order for the system as a whole to function effectively. For any given activity, several ...
Nathan Griffiths, Shanghua Sun