منابع مشابه
An Algorithm for Optimal Partitioning of Data on an Interval
Manuscript received XXX, 2003. This work was supported by the NASA Applied Information Systems Research Program, the Woodward Fund of San Jose State University, and the NASA Faculty Fellowship Program at Ames Research Center and Dryden Flight Research Center. B. Jackson is with the Department of Mathematics, San Jose State University, J. Scargle is with the Space Science Division, NASA Ames Res...
متن کاملProbability Interval Partitioning Entropy Codes
A novel approach to entropy coding is described that provides the coding efficiency and simple probability modeling capability of arithmetic coding at the complexity level of Huffman coding. The key element of the proposed approach is given by a partitioning of the unit interval into a small set of disjoint probability intervals for pipelining the coding process along the probability estimates ...
متن کاملAn Interval Partitioning Approach for Continuous Constrained Optimization
Constrained Optimization Problems (COP’s) are encountered in many scientific fields concerned with industrial applications such as kinematics, chemical process optimization, molecular design, etc. When non-linear relationships among variables are defined by problem constraints resulting in non-convex feasible sets, the problem of identifying feasible solutions may become very hard. Consequently...
متن کاملAn interval partitioning algorithm for constraint satisfaction problems
We propose an efficient interval partitioning algorithm to solve the continuous constraint satisfaction problem (CSP). The method comprises a new dynamic tree search management system that also invokes local search in selected subintervals. This approach is compared with two classical tree search techniques and three other interval methods. We study some challenging kinematics problems for test...
متن کاملOn-line Chain Partitioning of Up-growing Interval Orders
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5 w −1 4 chains to cover poset of width w. Felsner [3] introduced a variant of this problem considering only up-growing posets, i.e. on-line posets in which each new point is maximal at the moment of its arrival. He presented an algorithm using (
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1999
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-26-3-347-355