Sciweavers

957 search results - page 34 / 192
» Addition Chain Heuristics
Sort
View
JCC
2006
110views more  JCC 2006»
13 years 10 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs
AAAI
2010
13 years 9 months ago
A Trust Model for Supply Chain Management
hey generalize these factors to the abstract concepts of ability, integrity, and benevolence. This model does not use probabilistic decision theory. Other SCM trust factors have be...
Yasaman Haghpanah, Marie desJardins
SIGDOC
1997
ACM
14 years 2 months ago
Usability Studies of WWW Sites: Heuristic Evaluation vs. Laboratory Testing
This paper describes the strengths and weaknesses of two usability assessment methods frequently applied to web sites. It uses case histories of WWW usability studies conducted by...
Laurie Kantner, Stephanie Rosenbaum
IISWC
2006
IEEE
14 years 4 months ago
Performance Analysis of Sequence Alignment Applications
— Recent advances in molecular biology have led to a continued growth in the biological information generated by the scientific community. Additionally, this area has become a m...
Friman Sánchez, Esther Salamí, Alex ...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 2 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel