1547 search results - page 19 / 310 » Solving Knapsack Problems in a Sticker Based Model |
124
click to vote
HEURISTICS
2008
15 years 2 months ago
2008
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
119
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
124
click to vote
JNW
2007
15 years 2 months ago
2007
— Wireless sensor networks offer the potential to significantly improve the performance of pursuers in pursuit-evasion games. In this paper, we study several sensor network syst...
112
click to vote
AES
2006
Springer
15 years 2 months ago
2006
Springer
This paper describes the development and application of a piece of engineering software that provides a Problem Solving Environment (PSE) capable of launching, and interfacing wit...
130
click to vote
CONSTRAINTS
2010
14 years 12 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...