Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Casino floor optimization (2)
- Computer algorithms (2)
- Evolutionary computing (2)
- Non-linear data modeling (2)
- Travel time (Traffic engineering) (2)
-
- Triangulation (2)
- Abhinav thesis; Computer simulation; Hidden Markov model; Hidden semi-Markov model; HSMM; Implementation of HSMM; Markov processes; Mathematical models; Semi-Markov; Stochastic processes (1)
- Applied sciences (1)
- Arithmetic – Computer programs (1)
- Back propagation (Artificial intelligence) (1)
- Behavioral economics; Decision making; Dynamic decision making; Game of hog; Games of strategy (Mathematics) (1)
- Binary-coded decimal system (1)
- Decimal system (1)
- Degree constrained (1)
- Delaunay-Flip (1)
- Ear-clipping (1)
- Even degree (1)
- Express highways (1)
- Flipping (1)
- Geometry (1)
- Kalman filtering (1)
- Mesh generation (1)
- Multi-objective optimization (1)
- Numerical grid generation (Numerical analysis) (1)
- Open Shortest Path First (Computer network protocol) (1)
- Scan-Flip (1)
- Single and multi-objective optimization (1)
- Spatial resource optimization (1)
- Traffic flow (1)
- Publication
- Publication Type
Articles 1 - 11 of 11
Full-Text Articles in Theory and Algorithms
Optimizing The Mix Of Games And Their Locations On The Casino Floor, Jason D. Fiege, Anastasia D. Baran
Optimizing The Mix Of Games And Their Locations On The Casino Floor, Jason D. Fiege, Anastasia D. Baran
International Conference on Gambling & Risk Taking
We present a mathematical framework and computational approach that aims to optimize the mix and locations of slot machine types and denominations, plus other games to maximize the overall performance of the gaming floor. This problem belongs to a larger class of spatial resource optimization problems, concerned with optimizing the allocation and spatial distribution of finite resources, subject to various constraints. We introduce a powerful multi-objective evolutionary optimization and data-modelling platform, developed by the presenter since 2002, and show how this software can be used for casino floor optimization. We begin by extending a linear formulation of the casino floor …
Stationary And Time-Dependent Optimization Of The Casino Floor Slot Machine Mix, Anastasia D. Baran, Jason D. Fiege
Stationary And Time-Dependent Optimization Of The Casino Floor Slot Machine Mix, Anastasia D. Baran, Jason D. Fiege
International Conference on Gambling & Risk Taking
Modeling and optimizing the performance of a mix of slot machines on a gaming floor can be addressed at various levels of coarseness, and may or may not consider time-dependent trends. For example, a model might consider only time-averaged, aggregate data for all machines of a given type; time-dependent aggregate data; time-averaged data for individual machines; or fully time dependent data for individual machines. Fine-grained, time-dependent data for individual machines offers the most potential for detailed analysis and improvements to the casino floor performance, but also suffers the greatest amount of statistical noise. We present a theoretical analysis of single …
On High-Performance Parallel Decimal Fixed-Point Multiplier Designs, Ming Zhu
On High-Performance Parallel Decimal Fixed-Point Multiplier Designs, Ming Zhu
College of Engineering: Graduate Celebration Programs
Decimal computations are required in finance, and etc.
- Precise representation for decimals (E.g. 0.2, 0.7… )
- Performance Requirements (Software simulations are very slow)
Degree Constrained Triangulation, Roshan Gyawali
Degree Constrained Triangulation, Roshan Gyawali
UNLV Theses, Dissertations, Professional Papers, and Capstones
Triangulation of simple polygons or sets of points in two dimensions is a widely investigated problem in computational geometry. Some researchers have considered variations of triangulation problems that include minimum weight triangulation, de-launay triangulation and triangulation refinement. In this thesis we consider a constrained version of the triangulation problem that asks for triangulating a given domain (polygon or point sites) so that the resulting triangulation has an increased number of even degree vertices. This problem is called Degree Constrained Triangulation (DCT). We propose four algorithms to solve DCT problems. We also present experimental results based on the implementation of the …
Improved Algorithms For Ear-Clipping Triangulation, Bartosz Kajak
Improved Algorithms For Ear-Clipping Triangulation, Bartosz Kajak
UNLV Theses, Dissertations, Professional Papers, and Capstones
We consider the problem of improving ear-slicing algorithm for triangulating a simple polygon. We propose two variations of ear-slicing technique for generating “good-quality” triangulation. The first approach is based on searching for the best triangle along the boundary. The second approach considers polygon partitioning on a pre-process before applying the ear-slicing. Experimental investigation reveals that both approaches yield better quality triangulation than the standard ear-slicing method.
Implementation Of Hidden Semi-Markov Models, Nagendra Abhinav Dasu
Implementation Of Hidden Semi-Markov Models, Nagendra Abhinav Dasu
UNLV Theses, Dissertations, Professional Papers, and Capstones
One of the most frequently used concepts applied to a variety of engineering and scientific studies over the recent years is that of a Hidden Markov Model (HMM). The Hidden semi-Markov model (HsMM) is contrived in such a way that it does not make any premise of constant or geometric distributions of a state duration. In other words, it allows the stochastic process to be a semi-Markov chain. Each state can have a collection of observations and the duration of each state is a variable. This allows the HsMM to be used extensively over a range of applications. Some of …
Dynamic Decision Making And Race Games, Shipra De
Dynamic Decision Making And Race Games, Shipra De
Calvert Undergraduate Research Awards
Frequent criticism in dynamic decision making research pertains to the overly complex nature of the decision tasks used in experimentation. To address such concerns we study dynamic decision making with respect to the simple race game Hog, which has a computable optimal decision strategy. In the two-player game of Hog, individuals compete to be the first to reach a designated threshold of points. Players alternate rolling a desired quantity of dice. If the number one appears on any of the dice, the player receives no points for his turn; otherwise, the sum of the numbers appearing on the dice is …
A Fast And Simple Algorithm For Computing M Shortest Paths In Stage Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
A Fast And Simple Algorithm For Computing M Shortest Paths In Stage Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
Electrical & Computer Engineering Faculty Research
We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.
A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
Electrical & Computer Engineering Faculty Research
We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.
Real-Time Travel Time Estimation Using Macroscopic Traffic Flow Models, Pushkin Kachroo, Kaan Ozbay, Antoine G. Hobeika
Real-Time Travel Time Estimation Using Macroscopic Traffic Flow Models, Pushkin Kachroo, Kaan Ozbay, Antoine G. Hobeika
Electrical & Computer Engineering Faculty Research
This paper presents the estimation of travel time on highways based on macroscopic modelling. The focus is on real-time values as compared to average or static values. The macroscopic models are used for distributed and time/space lumped settings and corresponding travel time estimation functions and algorithms are developed. The implications of these algorithms for the implementation of various incident management and traffic control strategies are also discussed.
Investigating The Use Of Kalman Filtering Approaches For Dynamic Origin-Destination Trip Table Estimation, Pushkin Kachroo, Kaan Ozbay, Arvind Narayanan
Investigating The Use Of Kalman Filtering Approaches For Dynamic Origin-Destination Trip Table Estimation, Pushkin Kachroo, Kaan Ozbay, Arvind Narayanan
Electrical & Computer Engineering Faculty Research
This paper studies the applicability of Kalman filtering approaches for network wide traveler origin-destination estimation from link traffic volumes. The paper evaluates the modeling assumptions of the Kalman filters and examines the implications of such assumptions.