Build-up algorithms for distance geometry problem
主 题: Build-up algorithms for distance geometry problem
报告人: Professor Ya-xiang Yuan (Chinese Academy of Sciences)
时 间: 2013-11-15 14:00-15:00
地 点: 理科一号楼1114（数学所活动）
The distance geometry problem has many applications such as remote sensor localization in telecommunication networks, and protein structure predictions in biology and chemistry. In this talk, we will review build-up algorithms, one particular class of methods for the distance geometry problem. We will also discuss merit functions for the distance geometry problem, and propose a new merite function which can be used with the build-up technique.
