808 search results - page 43 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
ANOR
2007
14 years 9 months ago
2007
The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability to schedule their personnel properly. Sophisticated an...
CP
2009
Springer
15 years 4 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
SARA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper we introduce an evolutionary algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear integer p...
108
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper presents a novel method to increase the accuracy
of linear fitting of implicit polynomials. The proposed
method is based on the 3L algorithm philosophy. The novelty
l...