Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Frank Kwang-ming Hwang"'
The need for optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The “clustering” problem, which has recently received a lot of attention, is a special case of optimal partitioning
The need of optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The “clustering” problem, which has recently received a lot of attention, is a special case of optimal partitioning.
Autor:
Frank Kwang-ming Hwang, Ding-zhu Du
Pooling designs have been widely used in various aspects of DNA sequencing. In biological applications, the well-studied mathematical problem called “group testing” shifts its focus to nonadaptive algorithms while the focus of traditional group t
Autor:
Ding-zhu Du, Frank Kwang-ming Hwang
Group testing has been used in medical, chemical and electrical testing, coding, drug screening, pollution control, multiaccess channel management, and recently in data verification, clone library screening and AIDS testing. The mathematical model ca
Autor:
Ding-zhu Du, Frank Kwang-ming Hwang
Group testing was first proposed for blood tests, but soon found its way to many industrial applications. Combinatorial group testing studies the combinatorial aspect of the problem and is particularly related to many topics in combinatorics, compute
Autor:
Ding-zhu Du, Frank Kwang-ming Hwang
This book is a collection of surveys and exploratory articles about recent developments in the field of computational Euclidean geometry. The topics covered are: a history of Euclidean geometry, Voronoi diagrams, randomized geometric algorithms, comp
Nonsmooth optimization covers the minimization or maximization of functions which do not have the differentiability properties required by classical methods. The field of nonsmooth optimization is significant, not only because of the existence of non
Autor:
Ding-zhu Du, Frank Kwang-ming Hwang
This book is a collection of surveys and exploratory articles about recent developments in the field of computational Euclidean geometry. Topics covered include the history of Euclidean geometry, Voronoi diagrams, randomized geometric algorithms, com