5
votes
Interesting small SAT problems?
In general, you can look at hard combinatorial instances. If 50 variables is not a hard limit, try e.g., an instance arising from combinatorial block design having 105 variables described in [1]. The ...
- 22.4k
3
votes
Interesting small SAT problems?
See the international SAT solver competition. It's a competition that tests various solvers by running them on a library of hard SAT instances. You can download the instances they used to evaluate ...
D.W.♦
- 154k
3
votes
Why do I get really different results with my benchmarking code I made?
While benchmarking metal is mostly outside of the realms of computer science -- we usually don't want to worry about issues of materials and physics -- there are some general remarks here.
Tl;dr: ...
- 71.9k
2
votes
Accepted
How does the TEPS benchmark work and why is it relevant to real world problems?
Benchmark Motivation
The benchmark measures the performance of some very simple graph traversal algorithms on very large graphs. These algorithms need to be executed in parallel in order to take ...
- 11.8k
1
vote
Strategy to create a testbed and gold standard
You can't. You can't squeeze blood out of a stone. If you want to evaluate how well your method will work on real documents, you need real documents. With synthetically/artificially generated ...
D.W.♦
- 154k
1
vote
Relative Importance in Graph Theory
You can for instance take as ground truth data the movielens dataset, remove some rating links between users and movies. You can rank your algorithm by counting the number of link that you can guess ...
- 111
Only top scored, non community-wiki answers of a minimum length are eligible