596 search results - page 69 / 120 » Search Strategies for Hybrid Search Spaces |
ILP
2000
Springer
14 years 17 days ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
VLDB
1995
ACM
14 years 15 days ago
1995
ACM
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...
IADIS
2008
13 years 10 months ago
2008
Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational dat...
CG
2002
Springer
13 years 8 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
PAMI
2007
13 years 8 months ago
2007
—A new unsupervised forward orthogonal search (FOS) algorithm is introduced for feature selection and ranking. In the new algorithm, features are selected in a stepwise way, one ...