Browsing W & L Historic Theses by Subject "Washington and Lee University -- Honors in Computer Science"
Now showing items 1-5 of 5
-
Effectiveness of Genetic Algorithms in Finding Steinhaus Graphs with Maximal Clique Size
The goal of this research was to study the effectiveness of genetic algorithms (GA) in finding Steinhaus graphs of a given size whose maximal cliques were as large as possible. This investigation was based on the results ... -
Evaluating Host-Based Methods for Detecting Spoofed IP Packets
Billions of messages are transmitted across the Internet each day and most of these use the Internet Protocol (IP) to route packets to specific destinations based upon an IP address. While these packets contain both source ... -
Evolved Recursive Distributed Representations
Computer Science has become increasingly biologically inspired, with neural networks and evolutionary computing gaining increased prominence in the field. Recently, several difficulties with modeling connectionist networks ... -
Exploring Text-Based Analysis of Test-Case Dependencies of Web Applications
Web applications must be reliable as the number and popularity of web applications increases. Web applications are difficult to test because of the large input space and frequent changes. Thus their characteristics demand ... -
Lexical Disambiguation in Machine Translation with Latent Semantic Analysis
This paper examines a possible solution to the problem of disambiguating polysemous nouns in machine translation. Latent Semantic Analysis (LSA) , a statistical method of finding and representing word sense, is used to ...