86 search results - page 7 / 18 » Pruning Improves Heuristic Search for Cost-Sensitive Learnin... |
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we study a complex real world workforce scheduling problem. We apply constructive search and variable neighbourhood search (VNS) metaheuristics and enhance these meth...
ICCD
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— In this paper, we introduce a novel preimage computation technique that directly computes the circuit cofactors without an explicit search for any satisfiable solution...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...