Sciweavers

1539 search results - page 291 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
13 years 11 months ago
Multi-step environment learning classifier systems applied to hyper-heuristics
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
Javier G. Marín-Blázquez, Sonia Schu...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 11 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
TAMC
2007
Springer
14 years 1 months ago
Approximation Algorithms for 3D Orthogonal Knapsack
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf ...
IMSCCS
2006
IEEE
14 years 1 months ago
GenomeBlast: A Web Tool for Small Genome Comparison
Comparative genomics has become an essential approach for identifying homologous gene candidates and their functions, and for studying genome evolution. We developed GenomeBlast, ...
Guoqing Lu, Liying Jiang, Resa M. Kotalik, Thaine ...
KAIS
2011
129views more  KAIS 2011»
13 years 2 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis