Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Hybrid Solvers For The Boolean Satisfiability Problem: An Exploration, Nicole Nelson
Hybrid Solvers For The Boolean Satisfiability Problem: An Exploration, Nicole Nelson
Theses and Dissertations
The Boolean Satisfiability problem (SAT) is one of the most extensively researched NP-complete problems in Computer Science. This thesis focuses on the design of feasible solvers for this problem. A SAT problem instance is a formula in propositional logic. A SAT solver attempts to find a solution for the formula. Our research focuses on a newer solver paradigm, hybrid solvers, where two solvers are combined in order to gain the benefits from both solvers in the search for a solution. Our hybrid solver, AmbSAT, combines two well-known solvers: the systematic Davis-Putnam-Logemann-Loveland solver (DPLL) and the stochastic WalkSAT solver. AmbSAT's design …
A Glyph And Animation-Based Visualization System For Evaluation And Comparison Of Soccer Players, Edward Burns
A Glyph And Animation-Based Visualization System For Evaluation And Comparison Of Soccer Players, Edward Burns
Theses and Dissertations
The dimensionality of soccer statistics relating to both player and goalkeeper specific data can be difficult to interpret. Attempting to formulate an analysis of large sums of soccer statistics can be extremely challenging if the data is not presented graphically. As a result, we developed an application, titled Soccer Scoop, which provides two separate visualizations that can aid a soccer team manager. With this application, a team manager can compare two players on different teams, analyze a particular player before signing them to a contract, measure the performance of a particular player at different positions, generate practice exercises, and determine …
Visualizing Graphs With Distinguishable Edges And Ordered Binary Trees In Small Area, Andrew Fabian
Visualizing Graphs With Distinguishable Edges And Ordered Binary Trees In Small Area, Andrew Fabian
Theses and Dissertations
As graph layouts and visualizations have been at the forefront of graph drawing research for decades, it consequently led to aesthetic heuristics that not only generated better visualizations and aesthetically appealing graphs but also improved readability and understanding of the graphs. A variety of approaches examines aesthetics of nodes, edges, or graph layout, and related readability metrics. In this thesis, two solutions incorporating Gestalt principles to alleviate the effects of the edge crossing problem are presented. Alleviating this problem improves graph aesthetics and readability. Secondly, improving the known bounds on two aesthetic requirements (area and aspect ratio) for planar straight-line …