Sciweavers

263 search results - page 50 / 53
» Regret Bounds for Prediction Problems
Sort
View
CODES
2008
IEEE
14 years 4 months ago
Online adaptive utilization control for real-time embedded multiprocessor systems
To provide Quality of Service (QoS) guarantees in open and unpredictable environments, the utilization control problem is defined to keep the processor utilization at the schedula...
Jianguo Yao, Xue Liu, Mingxuan Yuan, Zonghua Gu
OPODIS
2008
13 years 11 months ago
Solving Atomic Multicast When Groups Crash
In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non...
Nicolas Schiper, Fernando Pedone
TIT
2002
95views more  TIT 2002»
13 years 9 months ago
On sequential strategies for loss functions with memory
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Mar...
ATAL
2011
Springer
12 years 9 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 9 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer