Topic: np-complete Goto Github
Some thing interesting about np-complete
Some thing interesting about np-complete
np-complete,Python solutions for Tim Roughgarden's 4 part books called Algorithms Illuminated
User: aishwarya34
np-complete,Explore different algorithms for Maximum 0-1 Knapsack
User: akphi
np-complete,Implementation and Evaluation of "Genetic" and "Simulated Annealing" algorithms for Extended version of Travelling Salesman Problem.
User: alimorty
np-complete,With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).
User: andrea-covre
np-complete,演算法筆記
User: andy6804tw
np-complete,Algorithms that demonstrate a quantum speedup on dynamic-programming solutions to certain problems
Organization: ascii-mentorships
Home Page: https://arxiv.org/abs/1807.05209
np-complete,Course projects on various NP and NPH problems on CTU in Prague 2021. Knapsack problem with various approaches, analysis of effectivity and robustness. Instances generation and validation. Approximation algorithms (FPTAS) and advanced iterative methods (genetic algorithm, simulated annealing).
User: bumbac
np-complete,Generalizations on backtracking algorithms (w or w/o recursion). They can use whatever data-structures and heuristic functions.
User: ceyzaguirre4
np-complete,Uniform: A Probabilistic SAT Solving Algorithm
User: charlesmjdana
np-complete,:satisfied: Boolean formula satisfiability algorithms for JavaScript
Organization: computational-problem-solving
Home Page: https://computational-problem-solving.github.io/sat
np-complete,The Swiss Army Knife of Applied Quantum Technology (Experimental Tech)
User: darkstarstrix
np-complete,a collection of benchmarks (in DIMACS format) for various NP-Complete problems
Organization: dynaroars
Home Page: https://unsat.github.io/npbench/
np-complete,In MWVCP, a member of np-complete family, it is required to find the vertex cover of a given graph such that the sum of the weights of the nodes is the minimum. A vertex cover of a graph is “a set of vertices such that each edge of the graph is incident to at least one vertex of the set”.
User: emrekumas
np-complete,An Ant Colony Optimization algorithm for the Traveling Salesman Problem
User: evanoman
np-complete,ALMA—MWX2SAT Solver
User: frankvegadelgado
Home Page: https://frankvegadelgado.github.io/alma/
np-complete,The repo of "Exploring the Network of Real-World Passwords: Visualization and Estimation" in SecureComm 2017.
User: googlr
Home Page: https://link.springer.com/chapter/10.1007/978-3-319-78813-5_8
np-complete,A general algorithm for Chinese Postman Problem
User: halflkaka
np-complete,solving knapsack problem using Ant Colony Optimization (ACO) algorithm
User: immohammadhosseini
np-complete,Implementation of classical problems in Computer Science in the Answer Set Solving dialect of Clingo.
User: joshuaguerin
np-complete,Graph coloring problem solved with Genetic Algorithm, Tabu Search and Simulated Annealing
User: juanjomrt
np-complete,Another subset sum problem solution in natural numbers.
User: kirilenkobm
np-complete,🔎 wheeler graph recognition algorithm, visualization and generation
User: kuanhao-chao
Home Page: https:// doi.org/10.1016/j.isci.2023.107402
np-complete,Solution finder for a popular mobile game "Flow Free". Solution for this game is in NP-Complete. Derived a polynomial time reduction algorithm to reduce the problem to satisfiability problem.
User: lhengi
np-complete,Exact and meta-heuristic algorithms for NP problems
User: lucasbotang
np-complete,Problem Solving: A Practical Workbook
User: maxtuno
np-complete,Genetic algorithm to solve np-complete maximization problems. Originally intended for fantasy sports.
User: michaelwayman
np-complete,Experimental minisat SAT solver reimplementation in Rust
User: mishun
np-complete, This class will create the knapsack, the items, and implement the three strategies to it to find their different execution times.
User: mraediaz
np-complete,The championship problem as a NP-complete problem: The application uses an up-to-date soccer league SQLite database to solve the championship problem with different algorithms.
User: nfroeh
np-complete,Fundamental Concepts of Computer Science (Draft) - by James Arvo
User: nnathan
np-complete,OptaPy is an AI constraint solver for Python to optimize planning and scheduling problems.
Organization: optapy
Home Page: https://www.optapy.org/
np-complete,https://portfolio.raghavkumar.co.in/collegeschduler Creates a college schedule using ant-colony optimisation to perform graph colouring. This was my sem 4 Software Engineering project
User: professorcode1
np-complete,Strip Packing Problem Visualizer
User: r-besson
Home Page: https://r-besson.github.io/strip-packing/
np-complete,Strip Packing Written in C++
User: r-besson
np-complete,A java implementation of the famous Lin-Kernighan heuristics algorithm implemented for graphic (symmetric) TSP
User: rodolfopichardo
np-complete,
User: sabrish89
np-complete,Google Hash Code 2018 Online Qualification Round
User: simonestefani
np-complete,Abordaje del desafío NP-Completo del Problema del Viatjant de Comerç en C++ mediante metodologías algorítmicas como Greedy, Backtracking, Branch & Bound y algoritmos probabilísticos.
User: skullkyai
np-complete,Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover
User: sleekpanther
np-complete,Joint (Maths & Computer Science) Senior Honours project on Graph Homomorphisms.
User: theoden8
np-complete,A Reduced-order Binary Decision Diagram (RoBDD) SAT solver written in Rust
User: timbeurskens
np-complete,PluSAT, a modular SAT solver
Organization: unb-sat
np-complete,Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!
Organization: universidade-livre
np-complete,Collection of Assignments and Programs For CS 146: Data Structures and Algorithms
User: uyen-carolyn
np-complete,knapsack - A fast solver for the 0/1-knapsack problem with multiple knapsacks
User: vaeth
np-complete,Go (golang) bindings for Picosat, the satisfiability solver
User: wkschwartz
np-complete,Solve the subset sum problem using genetic algorithms
User: yessinemkaouar
np-complete,Car Sequencing Problem solved by constraint programming approach and Choco Solver.
User: zakariamejdoul
np-complete,Russian Doll Search for Computing Maximum Vertex Weight Hereditary Structures in Graphs. Now with OpenMP support.
User: zhelih
Home Page: https://wp.lykhovyd.com/rds
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.