+ helpreset results/page
11 items found for «+cat:08*»
Active filters: x Year: 2011
Filter:
Type
11Dataset
11Item with a doi
Creator
10Planken, L.R.(Léon)
10de Weerdt, M.M.(Mathijs)
10van der Krogt, R.P.J.(Roman)
1van Dongen, B.F. (Boudewijn)
Subject
10Computation Theory and Mathematics
1Information Systems
Collection
10STP algorithms and instances of networks
1IEEE Task Force on Process Mining - Event Logs
Data format (mime type)
9application/x-gzip
1application/java-archive
1text/xml
1[none]
results 1-11
Real-life event logs - Hospital logDataset2011van Dongen, B.F. (Boudewijn)
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)
Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Scale-free; constant vertex count, varying density (Figure 3)Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
Network instance Chordal, fixed treewidth, edition 1Dataset2011Planken, 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" - Chordal, fixed size (Figure 1)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" (paper, 2011)]Dataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)
STP algorithms and experimentation (software), version 2011-03-publicDataset2011Planken, L.R.(Léon); de Weerdt, M.M.(Mathijs); van der Krogt, R.P.J.(Roman)