78 search results - page 6 / 16 » Local Search Algorithms for Partial MAXSAT |
114
click to vote
SODA
1997
ACM
15 years 1 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
126
click to vote
COR
2011
2011
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
14 years 7 months ago
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
104
click to vote
NIPS
2003
15 years 1 months ago
2003
We describe a new approximation algorithm for solving partially observable MDPs. Our bounded policy iteration approach searches through the space of bounded-size, stochastic fini...
CAD
1998
Springer
14 years 11 months ago
1998
Springer
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
COR
2006
14 years 12 months ago
2006
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art per...