Sciweavers

693 search results - page 29 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 8 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Abdellah Salhi, José Antonio Vázquez...
122
Voted
BMCBI
2005
158views more  BMCBI 2005»
15 years 1 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
CIVR
2010
Springer
204views Image Analysis» more  CIVR 2010»
15 years 5 months ago
Utilizing related samples to learn complex queries in interactive concept-based video search
One of the main challenges in interactive concept-based video search is the insufficient relevant sample problem, especially for queries with complex semantics. To address this pr...
Jin Yuan, Zheng-Jun Zha, Zhengdong Zhao, Xiangdong...
ECAL
2001
Springer
15 years 6 months ago
Taxonomy in Alife. Measures of Similarity for Complex Artificial Organisms
In this paper a formal approach to construction of a similarity measure for complex creatures is presented. The simulation model is described, and a Framsticks agent is expressed i...
Maciej Komosinski, Marek Kubiak
EVOW
2007
Springer
15 years 8 months ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...