diecaptain/papers-we-love
Papers from the computer science community to read and discuss.
This repository contains various algorithms programmed using Perl.
Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.
Papers from the computer science community to read and discuss.
A Hamiltonian path or traceable path is a path that visits each vertex exactly once. A graph that contains a Hamiltonian path is called a traceable graph. A graph is Hamiltonian-connected if for every pair of vertices there is a Hamiltonian path between the two vertices. A Hamiltonian cycle, Hamiltonian circuit, vertex tour or graph cycle is a cycle that visits each vertex exactly once (except for the vertex that is both the start and end, which is visited twice). A graph that contains a Hamiltonian cycle is called a Hamiltonian graph.
The project tries to implement a novel approach to track maximum power point of a solar PV module. The idea is to use fuzzy logic and develop Kalman filter algorithm according to it to enhance the stability of the outcoming power from a solar PV module. The project uses VHDL and the code is tested on Altera Cyclone 2 family device EP2C20F484C7. Presently, code has been written using behavorial and structural modelling and a layout of the design is made. The code is working perfectly for single round, however for a continuous approach, a lot of timing related problems are being faced. Testbench code is written for individual layers of the design to experiment with and find solutions. Feel free to notify changes anywhere. Any kind of help with the scheduling is highly appreciated. Thank you.
This repository aims at building a fuzzy logic readymade application in PERL. The code is a development of embedded_fuzzy_logic repository that has been forked. The scripts are in PERL.