Sciweavers

890 search results - page 22 / 178
» New Approaches to Compare Phylogenetic Search Heuristics
Sort
View
EOR
2006
57views more  EOR 2006»
15 years 1 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro
AAAI
2007
15 years 4 months ago
Computing Optimal Subsets
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shi...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 5 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
98
Voted
CEC
2009
IEEE
15 years 6 months ago
Grammar-based genetic programming for timetabling
Abstract— We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for prod...
Mohamed Bahy El Bader-El-Den, Riccardo Poli
BIBE
2007
IEEE
110views Bioinformatics» more  BIBE 2007»
15 years 8 months ago
Discrete Methods for Association Search and Status Prediction in Genotype Case-Control Studies
Abstract—Recent improvements in high-throughput genotyping technology make possible genome-wide association studies and status prediction (classification) for common complex dis...
Dumitru Brinza, Alexander Zelikovsky