Sciweavers

829 search results - page 84 / 166
» Bandit Algorithms for Tree Search
Sort
View
IPL
2010
114views more  IPL 2010»
14 years 8 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
ICDM
2002
IEEE
91views Data Mining» more  ICDM 2002»
15 years 2 months ago
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
Christian Borgelt, Michael R. Berthold
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
14 years 9 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
ACL
2009
14 years 7 months ago
Extending a Surface Realizer to Generate Coherent Discourse
We present a discourse-level Tree Adjoining Grammar which tightly integrates syntax and discourse levels, including a representation for discourse entities. We show that this tech...
Eva Banik
EUROGP
2010
Springer
172views Optimization» more  EUROGP 2010»
15 years 1 months ago
Geometric Differential Evolution on the Space of Genetic Programs
Abstract. Geometric Differential Evolution (GDE) is a very recently introduced formal generalization of traditional Differential Evolution (DE) that can be used to derive specific ...
Alberto Moraglio, Sara Silva