This is an advanced undergraduate course on algorithms. This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for ...

Successive Linear Programming (SLP) algorithms solve nonlinear optimization problems via a sequence of linear programs. They have been widely used, particularly in the oil and chemical industries, ...

Dinkelbach's algorithm [2] solving the parametric equivalent of a fractional program is investigated. It is shown that the algorithm converges superlinearly and often (locally) quadratically.

The computer science and engineering PhD prelim exam is a written exam and students will be tested on the three core subjects, computer architecture, algorithms, and operating systems.

Computer Scientists Find a Key Research Algorithm's Limits The most widely used technique for optimizing values of a math function turns out to be a fundamentally difficult computational problem.

A NEW breed of art has evolved. A computer program has been built that creates digital artworks using algorithms that mimic natural selection. Yasuhiro Suzuki at Nagoya University in Japan and ...