5 search results - page 1 / 1 » MAX-2-SAT: How Good Is Tabu Search in the Worst-Case |
AAAI
2004
13 years 6 months ago
2004
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
PROMISE
2010
12 years 11 months ago
2010
Background. Recent studies have shown that Support Vector Regression (SVR) has an interesting potential in the field of effort estimation. However applying SVR requires to careful...
PRL
2010
13 years 3 months ago
2010
The nearest-neighbour (1NN) classifier has long been used in pattern recognition, exploratory data analysis, and data mining problems. A vital consideration in obtaining good res...
AE
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
JAIR
2007
13 years 4 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...