Sciweavers

2128 search results - page 230 / 426
» A general characterization of indulgence
Sort
View
ECIS
2003
15 years 8 months ago
Conditions for change related to groupware in a distributed organization - a case study
Groupware is often used in distributed organizations to support communication and coordination. Managers direct resources and set up goals for the deployment of groupware. It is h...
Jesper Simonsen, Jens Kaaber Pors
SODA
2003
ACM
102views Algorithms» more  SODA 2003»
15 years 8 months ago
Online paging with arbitrary associativity
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
Enoch Peserico
AIPS
1996
15 years 8 months ago
A Candidate Set Based Analysis of Subgoal Interactions in Conjunctive Goal Planning
Subgoal interactions have received considerable attention in AI Planning. Earlier analyses by Korf [11] and Joslin and Roach [6] were done in terms of the topology of the space of...
Subbarao Kambhampati, Laurie H. Ihrig, Biplav Sriv...
ATAL
2010
Springer
15 years 7 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
15 years 7 months ago
RFQ: Redemptive Fair Queuing
Fair-queuing schedulers provide clients with bandwidth or latency guarantees provided they are well-behaved i.e. the requested service is always within strict predefined limits. V...
Ajay Gulati, Peter J. Varman