Sciweavers

62 search results - page 7 / 13
» Optimal BSR Solutions to Several Convex Polygon Problems
Sort
View
AUTOMATICA
2008
98views more  AUTOMATICA 2008»
13 years 7 months ago
An algorithm for bounded-error identification of nonlinear systems based on DC functions
This paper presents a guaranteed method for the parameter estimation of nonlinear models in a bounded-error context. This method is based on functions which consists of the differ...
J. M. Bravo, T. Alamo, M. J. Redondo, Eduardo F. C...
SODA
1992
ACM
135views Algorithms» more  SODA 1992»
13 years 8 months ago
Applications of Parametric Searching in Geometric Optimization
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...
MP
2002
85views more  MP 2002»
13 years 7 months ago
Generalized Goal Programming: polynomial methods and applications
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
Emilio Carrizosa, Jörg Fliege
IPPS
1994
IEEE
13 years 11 months ago
Efficient Matrix Chain Ordering in Polylog Time
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
Phillip G. Bradford, Gregory J. E. Rawlins, Gregor...