246 search results - page 33 / 50 » Dynamic Local Search for the Maximum Clique Problem |
CP
2006
Springer
15 years 1 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
UAI
2003
14 years 11 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
ISCAS
2008
IEEE
15 years 4 months ago
2008
IEEE
— We study the problem of automatic musical beat tracking from acoustic data, i.e., finding locations of beats of a music piece by computers on-the-fly, in this work. An online...
84
Voted
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Although Locality-Sensitive Hashing (LSH) is a promising approach to similarity search in high-dimensional spaces, it has not been considered practical partly because its search q...
164
Voted
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...