Sciweavers

14548 search results - page 354 / 2910
» The Optimal Path-Matching Problem
Sort
View
175
Voted
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
15 years 6 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
EOR
2007
78views more  EOR 2007»
15 years 6 months ago
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
Video on Demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, wh...
Tolga Bektas, Osman Oguz, Iradj Ouveysi
CP
2005
Springer
16 years 7 days ago
Caching Search States in Permutation Problems
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
Barbara M. Smith
ACSD
2007
IEEE
102views Hardware» more  ACSD 2007»
16 years 1 months ago
Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in...
Franck Cassez, Stavros Tripakis, Karine Altisen
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
16 years 26 days ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...