Sciweavers

660 search results - page 68 / 132
» Reasoning about Dynamic Policies
Sort
View
JNSM
2010
110views more  JNSM 2010»
14 years 6 months ago
Distributed Automatic Configuration of Complex IPsec-Infrastructures
The Internet Protocol Security Architecture IPsec is hard to deploy in large, nested, or dynamic scenarios. The major reason for this is the need for manual configuration of the cr...
Michael Rossberg, Guenter Schaefer, Thorsten Struf...
PLDI
2012
ACM
13 years 2 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
IPPS
2007
IEEE
15 years 6 months ago
Local Scheduling for Volunteer Computing
BOINC, a middleware system for volunteer computing, involves projects, which distribute jobs, and hosts, which execute jobs. The local (host-level) scheduler addresses two issues:...
David P. Anderson, John McLeod
NIPS
2003
15 years 1 months ago
An MDP-Based Approach to Online Mechanism Design
Online mechanism design (MD) considers the problem of providing incentives to implement desired system-wide outcomes in systems with self-interested agents that arrive and depart ...
David C. Parkes, Satinder P. Singh
RTS
2010
175views more  RTS 2010»
14 years 6 months ago
Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities
Safety-critical real-time standards define several criticality levels for the tasks (e.g., DO-178B - Software Considerations in Airborne Systems and Equipment Certification). Clas...
François Dorin, Pascal Richard, Michaë...