1040 search results - page 134 / 208 » Tools for modeling and solving search problems |
105
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
SIGIR
2005
ACM
15 years 6 months ago
2005
ACM
Non-negative Matrix Factorization (NMF, [5]) and Probabilistic Latent Semantic Analysis (PLSA, [4]) have been successfully applied to a number of text analysis tasks such as docum...
107
click to vote
CP
2003
Springer
15 years 5 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
100
Voted
ACRI
2006
Springer
15 years 6 months ago
2006
Springer
The goal of our investigation is to find automatically the absolutely best rule for a moving creature in a cellular field. The task of the creature is to visit all empty cells wi...
93
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...