Open Access. Powered by Scholars. Published by Universities.®
Numerical Analysis and Computation Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Prairie View A&M University (37)
- University of Dar es Salaam (18)
- Southern Methodist University (13)
- Illinois State University (12)
- Singapore Management University (12)
-
- Embry-Riddle Aeronautical University (6)
- University of Nevada, Las Vegas (6)
- Binghamton University (5)
- Claremont Colleges (5)
- Dartmouth College (5)
- University of Kentucky (5)
- California Polytechnic State University, San Luis Obispo (4)
- Georgia Southern University (4)
- Old Dominion University (4)
- The University of Southern Mississippi (4)
- University of Nebraska - Lincoln (4)
- Murray State University (3)
- New Jersey Institute of Technology (3)
- Technological University Dublin (3)
- The University of Akron (3)
- University of Arkansas, Fayetteville (3)
- University of New Mexico (3)
- East Tennessee State University (2)
- Karbala International Journal of Modern Science (2)
- Kennesaw State University (2)
- Loyola University Chicago (2)
- Michigan Technological University (2)
- University of Louisville (2)
- University of North Florida (2)
- University of South Carolina (2)
- Keyword
-
- Machine Learning (9)
- Machine learning (8)
- Neural Networks (5)
- Simulation (5)
- Breakdown (4)
-
- Computer Science (4)
- Deep learning (4)
- Subdivision (4)
- Bernoulli feedback (3)
- Cryptography (3)
- Curve design (3)
- Deep Learning (3)
- Feedback (3)
- Multiple vacation (3)
- Optimization (3)
- Refinable functions (3)
- Repair (3)
- A-ary (2)
- Abandonment (2)
- Algorithms (2)
- Applied Mathematics (2)
- Applied sciences (2)
- Artificial intelligence (2)
- Batch arrival (2)
- Bernoulli vacation (2)
- Bulk service (2)
- Bulking (2)
- Calculus of variations (2)
- Call center (2)
- Casino floor optimization (2)
- Publication Year
- Publication
-
- Applications and Applied Mathematics: An International Journal (AAM) (37)
- Tanzania Journal of Engineering and Technology (TJET) (18)
- Research Collection School Of Computing and Information Systems (12)
- Annual Symposium on Biomathematics and Ecology Education and Research (11)
- Mathematics Theses and Dissertations (7)
-
- Dissertations (6)
- Northeast Journal of Complex Systems (NEJCS) (5)
- Dartmouth College Master’s Theses (4)
- SMU Data Science Review (4)
- Theses and Dissertations (4)
- College of Graduate Studies: Theses & Dissertations (3)
- Electronic Theses and Dissertations (3)
- International Conference on Gambling & Risk Taking (3)
- Master's Theses (3)
- Publications (3)
- Theses and Dissertations--Mathematics (3)
- Williams Honors College, Honors Research Projects (3)
- Computer Science: Faculty Publications and Other Works (2)
- Conference papers (2)
- Dissertations and Doctoral Documents, University of Nebraska-Lincoln, 2023– (2)
- Dissertations, Master's Theses and Master's Reports (2)
- Doctoral Dissertations and Master's Theses (2)
- Honors College Theses (2)
- Journal of Humanistic Mathematics (2)
- Karbala International Journal of Modern Science (2)
- Mathematical Sciences Spring Lecture Series (2)
- Mathematics & Statistics ETDs (2)
- Mathematics Research (2)
- Murray State Theses and Dissertations (2)
- STAR Program Research Presentations (2)
- Publication Type
- File Type
Articles 211 - 215 of 215
Full-Text Articles in Numerical Analysis and Computation
Capacitated Network Revenue Management Through Shadow Pricing, Mustapha Bouhtou, Madiagne Diallo, Laura Wynter
Capacitated Network Revenue Management Through Shadow Pricing, Mustapha Bouhtou, Madiagne Diallo, Laura Wynter
Research Collection School Of Computing and Information Systems
In this paper, we analyze a method that links Lagrange multipliers from a resource allocation problem to the problem of revenue or profit maximization. This technique, first proposed in the transportation science literature by [7] has important implications for telecommunication network pricing. Indeed, the framework provides a generalization of telecommunication resource allocation/shadow price-based schemes such as those of [6] and [9], in that it permits the optimization of the shadow prices themselves, through a computationally simple procedure. We analyze the extent to which revenue can be maximized on a network that uses shadow-price-based prices, and how to deal with cases …
Application Of Vibrational Techniques In Determination Of Dynamic Properties Of Agricultural Products-State Of The Arton Of Vibrational Techniques In Determination Of Dynamic Properties Of Agricultural Products-State Of The Art, Silas Kajuna
Tanzania Journal of Engineering and Technology (TJET)
Vibration is one of the techniques employed in the determination of dynamic properties of fruits and vegetables. It entails generation of a mechanical or acoustic vibrational signal which is propagated through the flesh of the agricultural material. A transducer is either attached or held close to the specimen to monitor the propagation of the signal through the specimen. The manner in which the signal is transmitted through the material is analyzed, and the dynamic properties of the specimen which relate to its firmness or its internal being are derived. The technique has been around for the past 30 years or …
Multirate Time-Frequency Distributions, John R. O'Hair
Multirate Time-Frequency Distributions, John R. O'Hair
Theses and Dissertations
Multirate systems, which find application in the design and analysis of filter banks, are demonstrated to also be useful as a computational paradigm. It is shown that any problem which can be expressed a set of vector-vector, matrix-vector or matrix-matrix operations can be recast using multirate. This means all of numerical linear algebra can be recast using multirate as the underlying computational paradigm. As a non-trivial example, the multirate computational paradigm is applied to the problem of Generalized Discrete Time- Frequency Distributions GDTFD to create a new family of fast algorithms. The first of this new class of distributions is …
An Interval Newton Method, E R. Hansen, R I. Greenberg
An Interval Newton Method, E R. Hansen, R I. Greenberg
Computer Science: Faculty Publications and Other Works
We introduce an interval Newton method for bounding solutions of systems of nonlinear equations. It entails three subalgorithms. The first is a Gauss-Seidel-type step. The second is a real (noninterval) Newton iteration. The third solves the linearized equations by elimination. We explain why each subalgorithm is desirable and how they fit together to provide solutions in as little as one-third or one-quarter the time required by Krawczyk's method [7] in our implementations.
An Interval Arithmetic Newton Method For Solving Systems Of Nonlinear Equations, Ronald I. Greenberg, Eldon R. Hansen
An Interval Arithmetic Newton Method For Solving Systems Of Nonlinear Equations, Ronald I. Greenberg, Eldon R. Hansen
Computer Science: Faculty Publications and Other Works
We introduce an interval Newton method for bounding solutions of systems of nonlinear equations. It entails three sub-algorithms. The first is a Gauss-Seidel type step. The second is a real (non-interval) Newton iteration. The third solves the linearized equations by elimination. We explain why each sub-algorithm is desirable and how they fit together to provide solutions in as little as 1/3 to 1/4 the time required by a commonly used method due to Krawczyk.