+ helpreset results/page
25 items found
Active filters: x Subject: 0802 - Computation Theo...
Filter:
Type
25Dataset
25Item with a doi
Creator
19Planken, L.R.(Léon)
19de Weerdt, M.M.(Mathijs)
19van der Krogt, R.P.J.(Roman)
1Adatrao, S. (Sagar)
1Augusto, A. (Adriano)
1Bloemen, V. (Vincent)
1Conforti, R. (Raffaele)
1Dumas, M. (Marlon)
1La Rosa, M. (Marcello)
1Lanciano, G. (Giacomo)
1Maggi, F.M. (Fabrizio Maria)
1Marrella, A. (Andrea)
1Mecella, M. (Massimo)
1Rudnyk, J. (Julia)
1Sciacchitano, A. (Andrea)
1Soo, A. (Allar)
1de Leoni, M. (Massimiliano)
1van Dongen, B.F. (Boudewijn)
Year
32019
32018
92012
102011
Subject #2
1Numerical and Computational Mathematics
1Artificial Intelligence and Image Processing
1Information Systems
Collection
19STP algorithms and instances of networks
4 General collection of datasets
2IEEE Task Force on Process Mining - Event Logs
Data format (mime type)
17application/x-gzip
5application/zip
4text/plain
3text/xml
2application/java-archive
1application/msword
1application/pdf
1application/vnd.ms-excel
1image/png
1text/x-matlab
2[none]
results 1-20next ►
Data underlying the paper: Automated Discovery of Process Models from Event Logs: Review and BenchmarkDataset2019Augusto, A. (Adriano); Conforti, R. (Raffaele); Dumas, M. (Marlon); La Rosa, M. (Marcello); Maggi, F.M. (Fabrizio Maria); Marrella, A. (Andrea); Mecella, M. (Massimo); Soo, A. (Allar)
BPI Challenge 2019Dataset2019van Dongen, B.F. (Boudewijn)
MATLAB scripts created during the work on "Elimination of unsteady background reflections in PIV images by anisotropic diffusion"Dataset2019Adatrao, S. (Sagar); Sciacchitano, A. (Andrea)
Results of Trajectory Prediction Sensitivity Analysis Using Monte Carlo Simulations Based on Inputs' DistributionsDataset2018Rudnyk, J. (Julia)
Generated Petri Net Markup Language (PNML) models and log traces (in XES)Dataset2018Bloemen, V. (Vincent)
Models and Logs used in the paper ‘Aligning Partially-Ordered Process-Execution Traces and Models Using Automated Planning’ accepted for ICAPS 2018Dataset2018Lanciano, G. (Giacomo); de Leoni, M. (Massimiliano)
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 ►