Sciweavers

535 search results - page 44 / 107
» Generalized Version Space Trees
Sort
View
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 6 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 10 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
GECCO
2000
Springer
113views Optimization» more  GECCO 2000»
15 years 9 months ago
A Non-Linear Schema Theorem for Genetic Algorithms
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...
William A. Greene
STACS
1999
Springer
15 years 10 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
ATAL
2008
Springer
15 years 8 months ago
GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...
Andrew Gilpin, Tuomas Sandholm, Troels Bjerre S&os...