Implementing Energy Efficient Algorithm

Group 36

Inspiration

The following project has drawn inspirations from one of the most successful exact cover problem algorithms out there.

What it does

Basically performs exact cover problems by leveraging minimal memory footprints to obtain all possible solutions within shorter time frame show, execution time, memory used to validate power consumption compared to primitive approaches. (i.e. which was not able to be completed properly but can show some inspirations as to what we wanted to show )

The task was supposed to focus on unconstrained empty slots where parallelism would have had slighter advantage in performing better execution where it would have not that much of significance on constraint problems. But we were out of time.... :')

How we built it

Using Python Language we built a simple dlx algorithm to perform exact cover problem over simple brute-force technique

Challenges we ran into

Time constraints we were not able to properly show the potentiality of using parallel nature where it would perform very good in those scenarios.

Accomplishments that we're proud of

We were proud of our effort, despite being more over like a thesis project where there are many unknown variables and is in fact unique and unusual to be even doing it in a hackathon, building unrealistic expectation to somewhat reality

What we learned

In order to have sustainable environment, we have to make full use of our computing capabilities we have around, and use it wisely. As Ben said "With great power comes great responsibilities"