usage stats
Totals for datasets (co-)authored by L.R.(Léon) Planken
4033
downloads
35555
views
1
cites
L.R.(Léon) Planken
Datasets
- BDH agent problem instances
- BDH external constraint problem instances
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - New York (Figure 6)
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Chordal, fixed size (Figure 1)
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Diamonds (Figure 5)
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Job shop (Figure 7)
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - HTN (Figure 8)
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; constant vertex count, varying density (Figure 3)
- Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; varying vertex count, bounded induced width (Figure 4)
- DistSim: Java multiagent simulator
- Network instance Chordal, fixed size, edition 2
- Network instance Chordal, fixed treewidth, edition 1
- Network instance Diamonds, edition 2
- Network instance HTN, edition 2
- Network instance Job shop, edition 2
- Network instance New York, edition 2
- Network instance Scale-free; varying vertex count, bounded induced width, edition 2
- Network instance Scale-free; constant vertex count, varying density, edition 2
- STP algorithms and experimentation (software), version 2012-03-public
- WS agent problem instances
- WS task problem instances
