Sciweavers

715 search results - page 76 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
COR
2010
127views more  COR 2010»
14 years 10 months ago
Discrepancy search for the flexible job shop scheduling problem
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
Abir Ben Hmida, Mohamed Haouari, Marie-José...
ACCV
2007
Springer
15 years 4 months ago
Texture-Independent Feature-Point Matching (TIFM) from Motion Coherence
Abstract. This paper proposes a novel and efficient feature-point matching algorithm for finding point correspondences between two uncalibrated images. The striking feature of th...
Ping Li, Dirk Farin, Rene Klein Gunnewiek, Peter H...
ISMB
1997
14 years 11 months ago
Hierarchical Protein Structure Superposition Using Both Secondary Structure and Atomic Representations
The structural comparison of proteins has become increasingly important as a means to identify protein motifs and fold families. In this paper we present a new algorithm for the c...
Amit Pal Singh, Douglas L. Brutlag
IWPEC
2009
Springer
15 years 4 months ago
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
Peter Damaschke
FOCI
2007
IEEE
15 years 1 months ago
On the Influence of Phenotype Plasticity on Genotype Diversity
A large body of research has investigated the advantages of combining phenotype adaptation and genotype adaptation. The hybridization of genetic search and local search methods, of...
Ingo Paenke, Jürgen Branke, Yaochu Jin