Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
Procedural Level Generation For A Top-Down Roguelike Game, Kieran Ahn, Tyler Edmiston
Procedural Level Generation For A Top-Down Roguelike Game, Kieran Ahn, Tyler Edmiston
Honors Thesis
In this file, I present a sequence of algorithms that handle procedural level generation for the game Fragment, a game designed for CMSI 4071 and CMSI 4071 in collaboration with students from the LMU Animation department. I use algorithms inspired by graph theory and implementing best practices to the best of my ability. The full level generation sequence is comprised of four algorithms: the terrain generation, boss room placement, player spawn point selection, and enemy population. The terrain generation algorithm takes advantage of tree traversal methods to create a connected graph of walkable tiles. The boss room placement algorithm randomly …
Algorithms For Exploratory Queries Over Web Database, Md Farhadur Rahman
Algorithms For Exploratory Queries Over Web Database, Md Farhadur Rahman
Computer Science and Engineering Dissertations
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 everyday activity such as selecting a hotel in an area, locating a nearby restaurant etc. Google Maps, WeChat, FourSquare, AirBnB, TripAdvisor, and Hotels.com are a few such examples. The backed database of these applications can be a rich source of information for the corresponding application domain. For example, using Google Maps a user can find the ratings, reviews, and price of a restaurant, using Zillow …
Improving Time And Space Efficiency Of Trie Data Structure, Nirmik Milind Kale
Improving Time And Space Efficiency Of Trie Data Structure, Nirmik Milind Kale
Computer Science and Engineering Theses
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 that its time complexity is dependent on the length of the keys inserted or searched in the trie, instead of on the total number of keys in the data structure. Tries are also strong contenders to consider against hash tables in various applications due to two reasons - their almost deterministic time complexity based on average key length, especially when using large number of …
Crowd Data Analytics And Optimization, Habibur Rahman
Crowd Data Analytics And Optimization, Habibur Rahman
Computer Science and Engineering Dissertations
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 to exploit crowd in an unprecedented way. Crowdsourcing, nowadays, is considered as a tool to solve both simple tasks (such as labeling ground truth, image recognition etc.) and complex tasks (such as collaborative writing, citizen journalism etc.). Furthermore, it is also used to solve computational problems such as Entity Resolution, Top-k, Group-by etc. While crowdsourcing provides us with plenty of opportunities, it also presents us with …