Sciweavers

716 search results - page 101 / 144
» Rule Formats for Timed Processes
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Logarithmic weak regret of non-Bayesian restless multi-armed bandit
Abstract—We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. At each time, a player chooses K out of N (N > K) arms to play. The state of each ar...
Haoyang Liu, Keqin Liu, Qing Zhao
ECWEB
2004
Springer
148views ECommerce» more  ECWEB 2004»
14 years 1 months ago
OCL-Constraints for UMM Business Collaborations
Abstract. Recently, a trend towards business processes in Business-toBusiness e-Commerce (B2B) is apparent. One of the most promising approaches is UN/CEFACT’s modeling methodolo...
Birgit Hofreiter, Christian Huemer, Werner Winiwar...
HPCC
2007
Springer
14 years 1 months ago
A Data Imputation Model in Sensor Databases
Data missing is a common problem in database query processing, which can cause bias or lead to inefficient analyses, and this problem happens more often in sensor databases. The re...
Nan Jiang
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 1 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
13 years 11 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld