Browsing by Subject "Algorithms"
Now showing items 1-10 of 10
-
An Algorithm for Finding the Generalized Nucleolus of a Finite Set and the Multiobjective Discrete Programming Problems
(University of Texas at ArlingtonDepartment of Mathematics, 1982-03)**Please note that the full text is embargoed** -
Algorithms for Exploratory Queries over Web Database
(2019-02-06)In recent years we have seen an increase in the popularity of many web applications. The functionality of these applications range from allowing users to interact using online social network, to assist users in their ... -
Continuous Deformation of a Developable Surface
(University of Texas at ArlingtonDepartment of Mathematics, 1996-02)**Please note that the full text is embargoed** ABSTRACT: A developable surface can be developed from a piece of planar region, or vice versa. Several methods are known to construct an isometric mapping between the developable ... -
Crowd Data Analytics and Optimization
(2017-05-05)Crowdsourcing can be defined as outsourcing with crowd, where crowd refers to the online workers who are willing to complete simple tasks for small monetary compensation. The overwhelming reach of internet has enabled us ... -
Generalized Gradient Methods for Solving Locally Lipschitz Feasibility Problems
(University of Texas at ArlingtonDepartment of Mathematics, 1990-12)**Please note that the full text is embargoed** ABSTRACT: In this paper we study the behavior of a class of iterative algorithms for solving feasibility problems, that is finite systems of inequalities [see pdf for ... -
Greedy and Optimal Paths in a Weighted Graph Without Circuits and Applications to a Class of Optimization Problems on Finite Posets
(University of Texas at ArlingtonDepartment of Mathematics, 1983-05)**Please note that the full text is embargoed** ABSTRACT: In several recent papers B. Korte and L. Lovasz considered a mathematical structure called a simple language on which a greedy algorithm can operate (see [31,J41, ... -
Improving time and space efficiency of trie data structure
(2018-08-15)Trie or prefix tree is a data structure that has been used widely in some applications such as prefix-matching, auto-complete suggestions, and IP routing tables for a long time. What makes tries even more interesting is ... -
Multi-mesh reduced-order basis method for finite element analysis
(2017-08-16)Reduced order modeling of differential equations parametrized over a parameter space can be used to accelerate optimization and parameter estimation problems. The method of snapshots or reduced order basis is well established ... -
Pressure Method for the Numerical Solution of Transient, Compressible Fluid Flown
(University of Texas at ArlingtonDepartment of Mathematics, 1983-08)**Please note that the full text is embargoed** ABSTRACT: In this paper the pressure method for incompressible fluid flow simulation is extended and applied to the numerical simulation of compressible fluid flow. The ... -
Programs and Data Sets for Quasimolecular Modeling of Cavity Flow
(University of Texas at ArlingtonDepartment of Mathematics, 1987-01)**Please note that the full text is embargoed**