Sciweavers

2434 search results - page 53 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
CSDA
2007
100views more  CSDA 2007»
15 years 3 months ago
Convergence of random k-nearest-neighbour imputation
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
Fredrik A. Dahl
ANCS
2009
ACM
15 years 1 months ago
Weighted random oblivious routing on torus networks
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
Rohit Sunkam Ramanujam, Bill Lin
ICML
2010
IEEE
15 years 4 months ago
Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis
We introduce new, efficient algorithms for value iteration with multiple reward functions and continuous state. We also give an algorithm for finding the set of all nondominated a...
Daniel J. Lizotte, Michael H. Bowling, Susan A. Mu...
COMBINATORICA
2008
123views more  COMBINATORICA 2008»
15 years 1 months ago
Counting canonical partitions in the random graph
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Jean A. Larson
SECON
2007
IEEE
15 years 9 months ago
Fairness and Physical Layer Capture in Random Access Networks
Abstract— While physical layer capture has been observed in real implementations of wireless devices which randomly accessing shared channels, fair rate control algorithms based ...
Hoon Chang, Vishal Misra, Dan Rubenstein