Sciweavers

3455 search results - page 144 / 691
» Generalized Game Trees
Sort
View
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
13 years 7 months ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray
ICML
2003
IEEE
16 years 5 months ago
AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Oppon
A satisfactory multiagent learning algorithm should, at a minimum, learn to play optimally against stationary opponents and converge to a Nash equilibrium in self-play. The algori...
Vincent Conitzer, Tuomas Sandholm
148
Voted
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 10 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
IJCAI
2003
15 years 6 months ago
Information Extraction from Tree Documents by Learning Subtree Delimiters
Information extraction from HTML pages has been conventionally treated as plain text documents extended with HTML tags. However, the growing maturity and correct usage of HTML/XHT...
Boris Chidlovskii
JCM
2006
95views more  JCM 2006»
15 years 4 months ago
A Learning-based Adaptive Routing Tree for Wireless Sensor Networks
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be either static or mobile. Even in static cases, a s...
Ying Zhang, Qingfeng Huang