Sciweavers

12536 search results - page 2187 / 2508
» Cardinality Networks and Their Applications
Sort
View
TAMC
2009
Springer
16 years 1 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
DEBS
2009
ACM
16 years 1 months ago
Distributed agent environments in the Ambient Event Calculus
We study the development of distributed agent environments as distributed event-based systems specified in the Ambient Event Calculus (AEC). The AEC is a logic-based formalism th...
Stefano Bromuri, Kostas Stathis
GROUP
2009
ACM
16 years 1 months ago
Lazy scheduling of processing and transmission tasks in collaborative systems
A collaborative system must perform both processing and transmission tasks. We present a policy for scheduling these tasks on a single core that is inspired by studies of human pe...
Sasa Junuzovic, Prasun Dewan
SACMAT
2009
ACM
16 years 1 months ago
Automating role-based provisioning by learning from examples
Role-based provisioning has been adopted as a standard component in leading Identity Management products due to its low administration cost. However, the cost of adjusting existin...
Qun Ni, Jorge Lobo, Seraphin B. Calo, Pankaj Rohat...
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
« Prev « First page 2187 / 2508 Last » Next »