Sciweavers

1355 search results - page 59 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
RTSS
1990
IEEE
13 years 11 months ago
Dynamic Real-Time Optimistic Concurrency Control
In a recent study, we have shown that in real-time database systems that discard late transactions, optimistic concurrency control outperforms locking. Although the optimistic alg...
Jayant R. Haritsa, Michael J. Carey, Miron Livny
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 7 months ago
A Kernel Method for the Two-Sample Problem
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...
MOBIHOC
2012
ACM
11 years 10 months ago
Throughput of rateless codes over broadcast erasure channels
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
Yang Yang, Ness B. Shroff
AIPS
2010
13 years 10 months ago
Cost-Optimal Factored Planning: Promises and Pitfalls
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...
IJCAI
1993
13 years 9 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga