2702 search results - page 384 / 541 » constraints 2008 |
DAM
2000
14 years 10 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
SIAMCO
2000
14 years 9 months ago
2000
The set of all optimal controllers which maximize a robust stability radius for unstructured additive perturbations may be obtained using standard Hankel-norm approximation methods...
SIAMJO
2000
14 years 9 months ago
2000
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
DAM
1998
14 years 9 months ago
1998
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
DCG
1998
14 years 9 months ago
1998
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...