Skip to content

This project focuses on computability theory & heuristics. The program provides several approach for 0-1Knapsack and use them to NP-Complete problem, namely 3SAT (which is reduced subsequently into 1in3SAT, and SubsetSum).

Notifications You must be signed in to change notification settings

nlavee/Computability

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Computability, Complexity, and Heuristics

Folders Arrangement

Here are the descriptions for the content of each folder in this project in order to help you get to what you need faster.

  • src: As usual, this contains the Java codes for the experiments. The main that generates the instances and runs the experiment is provided in Implementation.java. There is a bash script named compile.sh that I used to compile and run Implementation.java so that I do not have to run the experiment out of Eclipse.
  • lib: This contains the Log4J jar that I used in order to log information from the experiments.
  • log: This contains the log generated from the experiments.
  • scripts: This contains Python scripts that I used to parse log files into csv so that I can effectively use it for statistical analysis.
  • data: This contains the csv file that is parsed for the use of statistical analysis. There are also two .RData files which are the data used to generate the report, also saved for references in R if needed.
  • Report: This contains the actual reports for the experiments as well as the Data Analysis R script that is used for analysis exploration. FinalReport.Rmd is the file that is used to generate the pdf of the report. There is also .RData file which is used to load data into the report for the R environment. The final report is found here

Contacts

My mail: [email protected]

About

This project focuses on computability theory & heuristics. The program provides several approach for 0-1Knapsack and use them to NP-Complete problem, namely 3SAT (which is reduced subsequently into 1in3SAT, and SubsetSum).

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published