Sciweavers

890 search results - page 43 / 178
» New Approaches to Compare Phylogenetic Search Heuristics
Sort
View
OOPSLA
2005
Springer
15 years 7 months ago
Inferring context-free grammars for domain-specific languages
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to...
Faizan Javed
IPPS
1997
IEEE
15 years 6 months ago
A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
Smaïl Niar, Arnaud Fréville
SOCO
2012
Springer
13 years 9 months ago
Variable mesh optimization for continuous optimization problems
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
Amilkar Puris, Rafael Bello, Daniel Molina, Franci...
FPL
2008
Springer
113views Hardware» more  FPL 2008»
15 years 3 months ago
Mapping and scheduling with task clustering for heterogeneous computing systems
This paper presents a new approach for mapping task graphs to heterogeneous hardware/software computing systems using heuristic search techniques. Two techniques: (1) integration ...
Yuet Ming Lam, José Gabriel F. Coutinho, Wa...
HEURISTICS
2006
120views more  HEURISTICS 2006»
15 years 1 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet