Reinforcement learning in real-world domains suffers from three curses of dimensionality: explosions in state and action spaces, and high stochasticity. We present approaches that ...
In clustering, global feature selection algorithms attempt to select a common feature subset that is relevant to all clusters. Consequently, they are not able to identify individu...
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
Treebank parsing can be seen as the search for an optimally refined grammar consistent with a coarse training treebank. We describe a method in which a minimal grammar is hierarc...
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli