336 search results - page 22 / 68 » Consultant-guided search algorithms for the quadratic assign... |
STOC
2012
ACM
11 years 10 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Opinion mining became an important topic of study in recent years due to its wide range of applications. There are also many companies offering opinion mining services. One proble...
BIBE
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
PVM
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
CADE
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...