Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
Query-Time Optimization Techniques For Structured Queries In Information Retrieval, Marc-Allen Cartright
Query-Time Optimization Techniques For Structured Queries In Information Retrieval, Marc-Allen Cartright
Open Access Dissertations
The use of information retrieval (IR) systems is evolving towards larger, more complicated queries. Both the IR industrial and research communities have generated significant evidence indicating that in order to continue improving retrieval effectiveness, increases in retrieval model complexity may be unavoidable. From an operational perspective, this translates into an increasing computational cost to generate the final ranked list in response to a query. Therefore we encounter an increasing tension in the trade-off between retrieval effectiveness (quality of result list) and efficiency (the speed at which the list is generated). This tension creates a strong need for optimization techniques to …
Artificial Immune Systems And Particle Swarm Optimization For Solutions To The General Adversarial Agents Problem, Jeremy Mange
Artificial Immune Systems And Particle Swarm Optimization For Solutions To The General Adversarial Agents Problem, Jeremy Mange
Dissertations
The general adversarial agents problem is an abstract problem description touching on the fields of Artificial Intelligence, machine learning, decision theory, and game theory. The goal of the problem is, given one or more mobile agents, each identified as either “friendly" or “enemy", along with a specified environment state, to choose an action or series of actions from all possible valid choices for the next “timestep" or series thereof, in order to lead toward a specified outcome or set of outcomes. This dissertation explores approaches to this problem utilizing Artificial Immune Systems, Particle Swarm Optimization, and hybrid approaches, along with …
Optimized Simulation Of Granular Materials, Seth R. Holladay
Optimized Simulation Of Granular Materials, Seth R. Holladay
Theses and Dissertations
Visual effects for film and animation often require simulated granular materials, such as sand, wheat, or dirt, to meet a director's needs. Simulating granular materials can be time consuming, in both computation and labor, as these particulate materials have complex behavior and an enormous amount of small-scale detail. Furthermore, a single cubic meter of granular material, where each grain is a cubic millimeter, would contain a billion granules, and simulating all such interacting granules would take an impractical amount of time for productions. This calls for a simplified model for granular materials that retains high surface detail and granular behavior …
Fair Cost Sharing Auction Mechanisms In Last Mile Ridesharing, Duc Thien Nguyen
Fair Cost Sharing Auction Mechanisms In Last Mile Ridesharing, Duc Thien Nguyen
Dissertations and Theses Collection (Open Access)
With rapid growth of transportation demands in urban cities, one major challenge is to provide efficient and effective door-to-door service to passengers using the public transportation system. This is commonly known as the Last Mile problem. In this thesis, we consider a dynamic and demand responsive mechanism for Ridesharing on a non-dedicated commercial fleet (such as taxis). This problem is addressed as two sub-problems, the first of which is a special type of vehicle routing problems (VRP). The second sub-problem, which is more challenging, is to allocate the cost (i.e. total fare) fairly among passengers. We propose auction mechanisms where …