2457 search results - page 249 / 492 » Local Search with Bootstrapping |
148
Voted
EPIA
1997
Springer
15 years 9 months ago
1997
Springer
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
173
Voted
UAI
2000
15 years 6 months ago
2000
Algorithms for learning the conditional probabilities of Bayesian networks with hidden variables typically operate within a high-dimensional search space and yield only locally op...
132
click to vote
PR
2008
15 years 5 months ago
2008
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
158
click to vote
DAM
2000
15 years 4 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
121
Voted
IDEAL
2009
Springer
15 years 2 months ago
2009
Springer
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...