Sciweavers

42 search results - page 2 / 9
» Solving a dynamic cell formation problem using metaheuristic...
Sort
View
CP
1998
Springer
13 years 9 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
BMCBI
2006
194views more  BMCBI 2006»
13 years 5 months ago
Novel metaheuristic for parameter estimation in nonlinear dynamic biological systems
Background: We consider the problem of parameter estimation (model calibration) in nonlinear dynamic models of biological systems. Due to the frequent ill-conditioning and multi-m...
Maria Rodriguez-Fernandez, Jose A. Egea, Julio R. ...
IJMC
2006
84views more  IJMC 2006»
13 years 5 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
HIS
2008
13 years 6 months ago
A GRASP Algorithm Using RNN for Solving Dynamics in a P2P Live Video Streaming Network
In this paper, we present an algorithm based on the GRASP metaheuristic for solving a dynamic assignment problem in a P2P network designed for sending real-time video over the Int...
Marcelo Martínez, Alexis Morón, Fran...
ACSC
2008
IEEE
13 years 7 months ago
An investigation of the state formation and transition limitations for prediction problems in recurrent neural networks
Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language r...
Angel Kennedy, Cara MacNish