Method and system for solving a problem involving a hypergraph partitioning
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Mar 13, 2018
Issued Date -
N/A
app pub date -
Dec 22, 2015
filing date -
Dec 22, 2015
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
A method for solving a problem involving a hypergraph partitioning is disclosed, the method comprising receiving an indication of a problem involving a hypergraph partitioning; obtaining at least one property associated with a quadratic unconstrained binary optimization solver operatively coupled with the digital computer; formulating a partitioning problem of the hypergraph as an unconstrained binary optimization problem; reducing the unconstrained binary optimization problem into a quadratic unconstrained binary optimization problem; mapping the quadratic unconstrained binary optimization problem into the quadratic unconstrained binary optimization solver; obtaining from the quadratic unconstrained binary optimization solver at least one solution to the quadratic unconstrained binary optimization problem; applying a refinement procedure and translating the refined at least one solution to provide an indication of the partitioning and providing a solution to the problem.
First Claim
Family
International Classification(s)
- [Classification Symbol]
- [Patents Count]
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully