Sciweavers

1407 search results - page 188 / 282
» Sponsored Search with Contexts
Sort
View
COR
2010
110views more  COR 2010»
13 years 10 months ago
An evolutionary method for complex-process optimization
In this paper we present a new evolutionary method for complex-process optimization. It is partially based on principles of the scatter search methodology, but it makes use of inn...
Jose A. Egea, Rafael Martí, Julio R. Banga
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 10 months ago
Locating phase transitions in computationally hard problems
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
B. Ashok, T. K. Patra
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 10 months ago
Evolving Dynamic Change and Exchange of Genotype Encoding in Genetic Algorithms for Difficult Optimization Problems
The application of genetic algorithms (GAs) to many optimization problems in organizations often results in good performance and high quality solutions. For successful and efficien...
Maroun Bercachi, Philippe Collard, Manuel Clergue,...
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
13 years 10 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
TOPNOC
2008
13 years 10 months ago
Directed Unfolding of Petri Nets
The key to efficient on-the-fly reachability analysis based on unfolding is to focus the expansion of the finite prefix towards the desired marking. However, current unfolding stra...
Blai Bonet, Patrik Haslum, Sarah L. Hickmott, Sylv...