Sciweavers

890 search results - page 23 / 178
» New Approaches to Compare Phylogenetic Search Heuristics
Sort
View
130
Voted
BIBE
2007
IEEE
138views Bioinformatics» more  BIBE 2007»
15 years 8 months ago
A Flexible Stem-Based Local Search Algorithm for Predicting RNA Secondary Structures Including Pseudoknots
-We demonstrate a new algorithm named FlexStem to predict RNA secondary structures with pseudoknots. Our approach is based on the free energy minimization criterion, and utilizes a...
Xiang Chen, Simin He, Dongbo Bu, Runsheng Chen, We...
119
Voted
DSN
2009
IEEE
15 years 8 months ago
Fitness-guided path exploration in dynamic symbolic execution
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
Tao Xie, Nikolai Tillmann, Jonathan de Halleux, Wo...
109
Voted
IJMC
2006
84views more  IJMC 2006»
15 years 1 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
MASCOTS
2007
15 years 3 months ago
Performance Analysis of Wireless MAC Protocols Using a Search Based Framework
—Previously, we have developed a framework to perform systematic analysis of CSMA/CA based wireless MAC protocols. The framework first identifies protocol states that meet our ...
Shamim Begum, Sandeep K. S. Gupta, Ahmed Helmy
IWANN
2001
Springer
15 years 6 months ago
A Comparison of Several Evolutionary Heuristics for the Frequency Assignment Problem
Abstract. The Frequency Assignment Problem (FAP) is a very important problem of practical interest. This work compares several evolutionary approaches to this problem, based both i...
Carlos Cotta, José M. Troya