Parallel Symbolic Relationship-Counting
| dc.contributor.author | Doering, Andreas C. | |
| dc.date.accessioned | 2017-06-29T14:30:50Z | |
| dc.date.available | 2017-06-29T14:30:50Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | One of the most basic operations, transforming a relationship into a function that gives the number of fulfilling elements, does not seem to be widely investigated. In this article a new algorithm for this problem is proposed. This algorithm can be implemented using Binary Decision Diagrams. The algorithm transforms a relation given as symbolic expression into a symbolic function, which can be further used, e.g. for finding maxima. The performance of an implementation based on JINC is given for a scalable example problem. | en |
| dc.identifier.pissn | 0177-0454 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V., Fachgruppe PARS | |
| dc.relation.ispartof | PARS-Mitteilungen: Vol. 32, Nr. 1 | |
| dc.title | Parallel Symbolic Relationship-Counting | en |
| dc.type | Text/Journal Article | |
| gi.citation.publisherPlace | Berlin |
Dateien
Originalbündel
1 - 1 von 1