+ helpreset results/page
25 items found
Active filters: x Collection: STP algorithms and i...
Filter:
Type
25Dataset
25Item with a doi
Creator
25Planken, L.R.(Léon)
19de Weerdt, M.M.(Mathijs)
19van der Krogt, R.P.J.(Roman)
6James C. Boerkoel Jr.
3Ronald J. Wilcox
Year
62013
92012
102011
Data format (mime type)
15application/x-gzip
4application/zip
3application/java-archive
3[none]
results 1-20next ►
DistSim: Java multiagent simulatorDataset2013Planken, L.R.(Léon); James C. Boerkoel Jr.
Multiagent STN benchmark instancesDataset2013Planken, L.R.(Léon); James C. Boerkoel Jr.; Ronald J. Wilcox
WS task problem instancesDataset2013Planken, L.R.(Léon); James C. Boerkoel Jr.; Ronald J. Wilcox
WS agent problem instancesDataset2013Planken, L.R.(Léon); James C. Boerkoel Jr.; Ronald J. Wilcox
BDH external constraint problem instancesDataset2013Planken, L.R.(Léon); James C. Boerkoel Jr.
BDH agent problem instancesDataset2013Planken, L.R.(Léon); James C. Boerkoel Jr.
STP algorithms and experimentation (software), version 2012-03-publicDataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance Scale-free; varying vertex count, bounded induced width, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance Scale-free; constant vertex count, varying density, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance New York, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance Job shop, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance HTN, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance Diamonds, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance Chordal, fixed size, edition 2Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]Dataset2012Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - HTN (Figure 8)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Job shop (Figure 7)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - New York (Figure 6)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Diamonds (Figure 5)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; varying vertex count, bounded induced width (Figure 4)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
results 1-20next ►