2457 search results - page 29 / 492 » Local Search with Bootstrapping |
JSAT
2008
15 years 18 days ago
2008
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
JAIR
2000
15 years 13 days ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
124
Voted
SIGIR
2012
ACM
13 years 3 months ago
2012
ACM
Users increasingly rely on their mobile devices to search local entities, typically businesses, while on the go. Even though recent work has recognized that the ranking signals in...
100
Voted
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
Discriminating between secreted and membrane proteins is a challenging task. This is particularly true for discriminating between transmembrane segments and signal peptides because...
154
click to vote
TAINN
2005
Springer
15 years 6 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...