Sciweavers

557 search results - page 59 / 112
» On the convergence time of distributed quantized averaging a...
Sort
View
NIPS
1994
15 years 7 months ago
On-line Learning of Dichotomies
The performance of on-line algorithms for learning dichotomies is studied. In on-line learning, the number of examples P is equivalent to the learning time, since each example is ...
N. Barkai, H. Sebastian Seung, Haim Sompolinsky
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 9 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
149
Voted
GCC
2006
Springer
15 years 9 months ago
BSM: A scheduling algorithm for dynamic jobs based on economics theory
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu, Jianji...
IPPS
2008
IEEE
16 years 8 hour ago
An effective pointer replication algorithm in P2P networks
Peer-to-Peer (P2P) networks have proven to be an efficient and successful mechanism for file sharing over the Internet. However, current P2P protocols have long worst case query...
Jian Zhou, Laxmi N. Bhuyan, Anirban Banerjee
EUROCAST
2007
Springer
182views Hardware» more  EUROCAST 2007»
15 years 11 months ago
A k-NN Based Perception Scheme for Reinforcement Learning
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
José Antonio Martin H., Javier de Lope Asia...