Sciweavers

282 search results - page 39 / 57
» Online Learning of Approximate Dependency Parsing Algorithms
Sort
View
JMLR
2006
153views more  JMLR 2006»
13 years 7 months ago
Collaborative Multiagent Reinforcement Learning by Payoff Propagation
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
Jelle R. Kok, Nikos A. Vlassis
ICML
1998
IEEE
14 years 8 months ago
Value Function Based Production Scheduling
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
Jeff G. Schneider, Justin A. Boyan, Andrew W. Moor...
ICCV
2009
IEEE
13 years 5 months ago
Local distance functions: A taxonomy, new algorithms, and an evaluation
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
Deva Ramanan, Simon Baker
CEC
2005
IEEE
14 years 1 months ago
A study on polynomial regression and Gaussian process global surrogate model in hierarchical surrogate-assisted evolutionary alg
This paper presents a study on Hierarchical Surrogate-Assisted Evolutionary Algorithm (HSAEA) using different global surrogate models for solving computationally expensive optimiza...
Zongzhao Zhou, Yew-Soon Ong, My Hanh Nguyen, Dudy ...
COLT
2004
Springer
14 years 1 months ago
Concentration Bounds for Unigrams Language Model
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
Evgeny Drukh, Yishay Mansour