Sciweavers

1047 search results - page 131 / 210
» Learning the required number of agents for complex tasks
Sort
View
CIKM
2008
Springer
13 years 9 months ago
Learning a two-stage SVM/CRF sequence classifier
Learning a sequence classifier means learning to predict a sequence of output tags based on a set of input data items. For example, recognizing that a handwritten word is "ca...
Guilherme Hoefel, Charles Elkan
ACG
2009
Springer
14 years 2 months ago
Monte-Carlo Tree Search in Settlers of Catan
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
Istvan Szita, Guillaume Chaslot, Pieter Spronck
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
14 years 2 days ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
EELC
2006
154views Languages» more  EELC 2006»
13 years 11 months ago
Unify and Merge in Fluid Construction Grammar
Research into the evolution of grammar requires that we employ formalisms and processing mechanisms that are powerful enough to handle features found in human natural languages. Bu...
Luc Steels, Joachim De Beule
CVPR
2007
IEEE
14 years 10 months ago
Image Classification with Segmentation Graph Kernels
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...
Francis Bach, Zaïd Harchaoui