1171 search results - page 143 / 235 » Variable neighborhood search |
119
click to vote
AI
2005
Springer
15 years 22 days ago
2005
Springer
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
101
Voted
FORMATS
2010
Springer
14 years 10 months ago
2010
Springer
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework ...
122
Voted
CEC
2011
IEEE
14 years 24 days ago
2011
IEEE
—Over the last two decades, many Differential Evolution (DE) strategies have been introduced for solving Optimization Problems. Due to the variability of the characteristics in o...
129
Voted
CONSTRAINTS
2010
15 years 28 days ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
132
click to vote
CGO
2011
IEEE
14 years 4 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...