Sciweavers

1547 search results - page 19 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
HEURISTICS
2008
153views more  HEURISTICS 2008»
13 years 7 months ago
Bringing order into the neighborhoods: relaxation guided variable neighborhood search
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...
Jakob Puchinger, Günther R. Raidl
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
13 years 8 months ago
Managing team-based problem solving with symbiotic bid-based genetic programming
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...
Peter Lichodzijewski, Malcolm I. Heywood
JNW
2007
80views more  JNW 2007»
13 years 7 months ago
A New Method of Using Sensor Network for Solving Pursuit-Evasion Problem
— 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...
Peng Zhuang, Yi Shang, Hongchi Shi
AES
2006
Springer
106views Cryptology» more  AES 2006»
13 years 7 months ago
A grid-enabled problem solving environment for parallel computational engineering design
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...
C. E. Goodyer, Martin Berzins, Peter K. Jimack, L....
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 4 months ago
Solving satisfiability problems with preferences
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 ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...