Sciweavers

10 search results - page 2 / 2
» The Dynamic Knapsack Problem Revisited: A New Benchmark Prob...
Sort
View
HEURISTICS
2008
153views more  HEURISTICS 2008»
13 years 5 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
CPAIOR
2006
Springer
13 years 8 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
IPPS
2005
IEEE
13 years 10 months ago
FROST: Revisited and Distributed
FROST (Fold Recognition-Oriented Search Tool) [6] is a software whose purpose is to assign a 3D structure to a protein sequence. It is based on a series of filters and uses a dat...
Vincent Poirriez, Rumen Andonov, Antoine Marin, Je...
PADS
2003
ACM
13 years 10 months ago
Power-aware State Dissemination in Mobile Distributed Virtual Environments
In distributed simulations, such as multi-player distributed virtual environments (DVE), power consumption traditionally has not been a major design factor. However, emerging batt...
Weidong Shi, Kalyan S. Perumalla, Richard M. Fujim...
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
13 years 10 months ago
A genetic algorithm for unmanned aerial vehicle routing
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
Matthew A. Russell, Gary B. Lamont