Sciweavers

4229 search results - page 474 / 846
» On the Optimality of Spiral Search
Sort
View
BMCBI
2008
121views more  BMCBI 2008»
15 years 7 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...
CCE
2006
15 years 7 months ago
Design of heat exchanger networks using randomized algorithm
A randomized algorithm with stream splitting for design of heat exchanger networks is presented in this work. The algorithm has provisions for splitting any one of the process str...
Ankur Pariyani, Abhigyan Gupta, Pallab Ghosh
SIAMDM
2008
143views more  SIAMDM 2008»
15 years 6 months ago
Coloring Bull-Free Perfectly Contractile Graphs
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
Benjamin Lévêque, Frédé...
CORR
2004
Springer
168views Education» more  CORR 2004»
15 years 6 months ago
Estimating Genome Reversal Distance by Genetic Algorithm
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
Andy Auyeung, Ajith Abraham
HEURISTICS
2002
65views more  HEURISTICS 2002»
15 years 6 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...