589 search results - page 38 / 118 » Local Search Algorithms for SAT: An Empirical Evaluation |
133
click to vote
ILP
2004
Springer
15 years 5 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
SAC
2008
ACM
14 years 11 months ago
2008
ACM
Recommender Systems (RS) aim at predicting items or ratings of items that the user are interested in. Collaborative Filtering (CF) algorithms such as user- and item-based methods ...
100
click to vote
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
112
click to vote
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
100
click to vote
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...