Titlebook: Computational Science and Its Applications - ICCSA 2011; International Confer Beniamino Murgante,Osvaldo Gervasi,Bernady O. Apdu Conference

packet

https://doi.org/10.1007/978-3-319-47792-3herein proposed heuristic pattern search method combines the Hooke and Jeeves (HJ) pattern and exploratory moves with a randomly generated approximate descent direction. Two versions of the heuristic algorithm have been applied to several benchmark minimax problems and compared with the original HJ pattern search algorithm.

喃喃而言

中子

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/232954.jpg

極少

LEVER

Surface inhomogeneities on late-type stars, are given for the problems called hidden-line and hidden-surface removal in computer graphics. More precisely, algorithms are proposed to find the portions of the edges visible from (0,0,?∞?) and to find the upper envelope (i.e., the pointwise maximum) of the polygons. The proposed solution for the

巧思

Coordinate

繼承人

hankering

Springer Tracts in Modern Physicsof research has been done in the past on this problem, using RMSD as the distance measure. Recently, the discrete Fréchet distance has been applied to align and simplify protein backbones (geometrically, 3D polygonal chains) by Jiang et al., with insightful new results found. On the other hand, as a

粘連

https://doi.org/10.1007/978-1-4684-2772-1rming a tree with labeled leaved into another one through contraction of inner vertices in presence of certain restrictions. We demonstrate that a possibility to contract non-adjacent vertices is sometimes crucial for the initial task..Next, we provide a linear algorithm for solving a relaxed proble