Sciweavers

4315 search results - page 142 / 863
» Sorting in linear time
Sort
View
HYBRID
2010
Springer
14 years 4 months ago
Stabilization of planar switched linear systems using polar coordinates
Analysis of stability and stabilizability of switched linear systems is a well-researched topic. This article pursues a polar coordinate approach which offers a convenient framew...
Andrew B. Godbehere, Shankar S. Sastry
FOCS
1991
IEEE
14 years 19 days ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
13 years 10 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
13 years 9 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
ICPADS
2007
IEEE
14 years 3 months ago
Scheduling multiple divisible loads on a linear processor network
Min, Veeravalli, and Barlas have recently proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one...
Matthieu Gallet, Yves Robert, Frédér...