We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Currently, the target costs (c_optimal) for the QUBO workloads have only been globally solved for graphs of size 10 and 25, while sizes 50 to 5000 are solved with the DWave Tabu sampler. https://github.com/NeuroBench/system_benchmarks/blob/main/QUBO/default_config.csv
Graphs of size 50, 100, 250, 500 can be attempted to be globally solved as well.
The text was updated successfully, but these errors were encountered:
Note: up until n=250, d=0.01 matches tabu sampler.
n=250, d=0.05, s=0 is the first instance of finding a larger independent set, and it is also the first to take a considerable runtime.
Sorry, something went wrong.
Successfully merging a pull request may close this issue.
Currently, the target costs (c_optimal) for the QUBO workloads have only been globally solved for graphs of size 10 and 25, while sizes 50 to 5000 are solved with the DWave Tabu sampler.
https://github.com/NeuroBench/system_benchmarks/blob/main/QUBO/default_config.csv
Graphs of size 50, 100, 250, 500 can be attempted to be globally solved as well.
The text was updated successfully, but these errors were encountered: