People, problems, and proofs are the lifeblood of theoretical computer science. Behind the computing devices and applications that have transformed our lives are clever algorithms, and for every worthwhile algorithm there is a problem that it solves and a proof that it works. Before this proof there was an open problem: can one create an efficient algorithm to solve the computational problem? A…
No Inv.: 2197-2216/P/Perp/97/20c
Introduction to Global Optimization Exploiting Space-Filling Curves provides an overview of classical and new results pertaining to the usage of space-filling curves in global optimization. The authors look at a family of derivative-free numerical algorithms applying space-filling curves to reduce the dimensionality of the global optimization problem; along with a number of unconventional idea…
No Inv.: 6800-6809/P/Perp/97/10c
No Inv.: 6971-6973/P/Perp/97/3c~114028/P/Perp/08/1c~116321-116323/P/Perp/09/3c~121577-121581/P/Perp/09/5c
No Inv.: 2913-2920/P/Perp/98/2c
No Inv.: 11427/P/Perp/98/1c
No Inv.: 10711/P/Perp/97/1c
No Inv.: 11007/P/Perp/98/1c
No Inv.: 1187/S/Perp/98/1c