0
I Use This!
Activity Not Available
Analyzed 12 months ago. based on code collected over 1 year ago.

Project Summary

The aim of the PL-PSF project is to create a generic domain-independent combinatorial problem solver. It uses a petri-nets based model to represent the problems and problem decomposition/abstraction with graph topology analysis to solve them.

Tags

No tags have been added

In a Nutshell, PL-PSF...

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
  • ...
    you can subscribe to e-mail newsletters to receive update from the Open Hub blog
  • ...
    55% of companies leverage OSS for production infrastructure
  • ...
    by exploring contributors within projects, you can view details on every commit they have made to that project

Languages

Languages?height=75&width=75
HTML
48%
XML
18%
C++
17%
6 Other
17%

30 Day Summary

Feb 8 2017 — Mar 10 2017

12 Month Summary

Mar 10 2016 — Mar 10 2017

Ratings

Be the first to rate this project
Click to add your rating
   Spinner
Review this Project!