default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathijs de Weerdt
Mathijs Michiel de Weerdt
Person information
- affiliation: Delft University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c80]Konstantin Sidorov
, Gonçalo Homem De Almeida Correia, Mathijs de Weerdt, Emir Demirovic:
Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths. AAAI 2024: 20794-20802- [c79]Kim van den Houten, David M. J. Tax, Esteban Freydell, Mathijs de Weerdt:
Learning from Scenarios for Repairable Stochastic Scheduling. CPAIOR (2) 2024: 234-242 - [c78]Issa K. Hanou, Devin Wild Thomas, Wheeler Ruml, Mathijs de Weerdt:
Replanning in Advance for Instant Delay Recovery in Multi-Agent Applications: Rerouting Trains in a Railway Hub. ICAPS 2024: 258-266 - [c77]Grigorii Veviurko, Wendelin Boehmer, Mathijs de Weerdt:
To the Max: Reinventing Reward in Reinforcement Learning. ICML 2024 - [c76]Junhan Wen, Camiel R. Verschoor, Chengming Feng, Irina-Mona Epure, Thomas Abeel, Mathijs de Weerdt:
The Growing Strawberries Dataset: Tracking Multiple Objects with Biological Development over an Extended Period. WACV 2024: 7089-7099 - [p2]Willem van Jaarsveld, Alp Akçay, Laurens Bliek, Paulo da Costa, Mathijs de Weerdt, Rik Eshuis, Stella Kapodistria, Uzay Kaymak, Verus Pronk, Geert-Jan van Houtum, Peter Verleijsdonk, Sicco Verwer, Simon Voorberg, Yingqian Zhang:
Real-Time Data-Driven Maintenance Logistics: A Public-Private Collaboration. Commit2Data 2024: 5:1-5:13 - [i25]Grigorii Veviurko, Wendelin Böhmer, Mathijs de Weerdt:
To the Max: Reinventing Reward in Reinforcement Learning. CoRR abs/2402.01361 (2024) - [i24]Ksenija Stepanovic, Wendelin Böhmer, Mathijs de Weerdt:
A Penalty-Based Guardrail Algorithm for Non-Decreasing Optimization with Inequality Constraints. CoRR abs/2405.01984 (2024) - [i23]Kim van den Houten, Léon Planken, Esteban Freydell, David M. J. Tax, Mathijs de Weerdt:
Proactive and Reactive Constraint Programming for Stochastic Project Scheduling with Maximal Time-Lags. CoRR abs/2409.09107 (2024) - [i22]Jacobus G. M. van der Linden, Daniël Vos, Mathijs Michiel de Weerdt, Sicco Verwer, Emir Demirovic:
Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance. CoRR abs/2409.12788 (2024) - 2023
- [j21]Laurens Bliek, Arthur Guijt, Rickard Karlsson, Sicco Verwer, Mathijs de Weerdt:
Benchmarking surrogate-based optimisation algorithms on expensive black-box functions. Appl. Soft Comput. 147: 110744 (2023) - [c75]Issa K. Hanou, Mathijs Michiel de Weerdt, Jesse Mulderij:
Moving Trains like Pebbles: A Feasibility Study on Tree Yards. ICAPS 2023: 482-490 - [c74]Jacobus G. M. van der Linden, Mathijs de Weerdt, Emir Demirovic:
Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming. NeurIPS 2023 - [c73]Kim van den Houten, Mathijs de Weerdt, David M. J. Tax, Esteban Freydell, Eva Christoupoulou, Alessandro Nati:
Rolling-Horizon Simulation Optimization For A Multi-Objective Biomanufacturing Scheduling Problem. WSC 2023: 1912-1923 - [i21]Jacobus G. M. van der Linden, Mathijs Michiel de Weerdt, Emir Demirovic:
Optimal Decision Trees for Separable Objectives: Pushing the Limits of Dynamic Programming. CoRR abs/2305.19706 (2023) - [i20]Grigorii Veviurko, Wendelin Böhmer, Mathijs de Weerdt:
You Shall not Pass: the Zero-Gradient Problem in Predict and Optimize for Convex Optimization. CoRR abs/2307.16304 (2023) - [i19]Gleb Polevoy, Stojan Trajanovski, Mathijs de Weerdt:
When Effort May Fail: Equilibria of Shared Effort with a Threshold. CoRR abs/2312.01513 (2023) - [i18]Kim van den Houten, David M. J. Tax, Esteban Freydell, Mathijs de Weerdt:
Learning From Scenarios for Stochastic Repairable Scheduling. CoRR abs/2312.03492 (2023) - 2022
- [j20]Madeleine E. M. A. van Hövell, Rob M. P. Goverde, Nikola Besinovic, Mathijs Michiel de Weerdt:
Increasing the effectiveness of the capacity usage at rolling stock service locations. J. Rail Transp. Plan. Manag. 21: 100297 (2022) - [j19]Arthur Guijt, Ngoc Hoang Luong, Peter A. N. Bosman, Mathijs de Weerdt:
On the impact of linkage learning, gene-pool optimal mixing, and non-redundant encoding on permutation optimization. Swarm Evol. Comput. 70: 101044 (2022) - [c72]Grigory Neustroev, Sytze P. E. Andringa, Remco A. Verzijlbergh, Mathijs Michiel de Weerdt:
Deep Reinforcement Learning for Active Wake Control. AAMAS 2022: 944-953 - [c71]Jacobus G. M. van der Linden, Mathijs de Weerdt, Emir Demirovic:
Fair and Optimal Decision Trees: A Dynamic Programming Approach. NeurIPS 2022 - 2021
- [j18]Laurens Bliek, Sicco Verwer, Mathijs de Weerdt:
Black-box combinatorial optimization using models with integer-valued minima. Ann. Math. Artif. Intell. 89(7): 639-653 (2021) - [j17]Mathijs de Weerdt, Robert Baart, Lei He:
Single-machine scheduling with release times, deadlines, setup times, and rejection. Eur. J. Oper. Res. 291(2): 629-639 (2021) - [j16]Frits de Nijs, Erwin Walraven, Mathijs Michiel de Weerdt, Matthijs T. J. Spaan:
Constrained Multiagent Markov Decision Processes: a Taxonomy of Problems and Algorithms. J. Artif. Intell. Res. 70: 955-1001 (2021) - [j15]Jordi Zomer, Nikola Besinovic, Mathijs Michiel de Weerdt, Rob M. P. Goverde:
The Maintenance Location Choice Problem for railway rolling stock. J. Rail Transp. Plan. Manag. 20: 100268 (2021) - [c70]Jacobus G. M. van der Linden, Jesse Mulderij, Bob Huisman, Joris W. den Ouden, Marjan van den Akker, Han Hoogeveen, Mathijs Michiel de Weerdt:
TORS: A Train Unit Shunting and Servicing Simulator. AAMAS 2021: 1785-1787 - [c69]Laurens Bliek, Arthur Guijt, Sicco Verwer, Mathijs de Weerdt:
Black-box mixed-variable optimisation using a surrogate model that satisfies integer constraints. GECCO Companion 2021: 1851-1859 - [c68]Burak Yildiz, Hayley Hung, Jesse H. Krijthe, Cynthia C. S. Liem, Marco Loog, Gosia Migut, Frans A. Oliehoek, Annibale Panichella, Przemyslaw Pawelczak, Stjepan Picek, Mathijs de Weerdt, Jan van Gemert:
ReproducedPapers.org: Openly Teaching and Structuring Machine Learning Reproducibility. RRPR 2021: 3-11 - [i17]Jordi Zomer, Nikola Besinovic, Mathijs Michiel de Weerdt, Rob M. P. Goverde:
The Maintenance Scheduling and Location Choice Problem for Railway Rolling Stock. CoRR abs/2103.00454 (2021) - [i16]Laurens Bliek, Arthur Guijt, Rickard Karlsson, Sicco Verwer, Mathijs de Weerdt:
EXPObench: Benchmarking Surrogate-based Optimisation Algorithms on Expensive Black-box Functions. CoRR abs/2106.04618 (2021) - 2020
- [j14]Lei He, Mathijs de Weerdt, Neil Yorke-Smith:
Time/sequence-dependent scheduling: the design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm. J. Intell. Manuf. 31(4): 1051-1078 (2020) - [c67]Grigory Neustroev, Mathijs Michiel de Weerdt:
Generalized Optimistic Q-Learning with Provable Efficiency. AAMAS 2020: 913-921 - [c66]Rickard Karlsson, Laurens Bliek, Sicco Verwer, Mathijs de Weerdt:
Continuous Surrogate-Based Optimization Algorithms Are Well-Suited for Expensive Discrete Problems. BNAIC/BENELEARN (Selected Papers) 2020: 48-63 - [i15]Koos van der Linden, Natalia Romero, Mathijs Michiel de Weerdt:
Benchmarking Flexible Electric Loads Scheduling Algorithms under Market Price Uncertainty. CoRR abs/2002.01246 (2020) - [i14]Hazem A. Abdelghany, Simon H. Tindemans, Mathijs Michiel de Weerdt, Han La Poutré:
Distributed Coordination of Deferrable Loads: A Real-time Market with Self-fulfilling Forecasts. CoRR abs/2004.03236 (2020) - [i13]Laurens Bliek, Sicco Verwer, Mathijs de Weerdt:
Black-box Mixed-Variable Optimisation using a Surrogate Model that Satisfies Integer Constraints. CoRR abs/2006.04508 (2020) - [i12]Jesse Mulderij, Bob Huisman, Denise D. Tönissen, Koos van der Linden, Mathijs de Weerdt:
Train Unit Shunting and Servicing: a Real-Life Application of Multi-Agent Path Finding. CoRR abs/2006.10422 (2020) - [i11]Rickard Karlsson, Laurens Bliek, Sicco Verwer, Mathijs de Weerdt:
Continuous surrogate-based optimization algorithms are well-suited for expensive discrete problems. CoRR abs/2011.03431 (2020) - [i10]Burak Yildiz, Hayley Hung, Jesse H. Krijthe, Cynthia C. S. Liem, Marco Loog, Gosia Migut, Frans A. Oliehoek, Annibale Panichella, Przemyslaw Pawelczak, Stjepan Picek, Mathijs de Weerdt, Jan van Gemert:
ReproducedPapers.org: Openly teaching and structuring machine learning reproducibility. CoRR abs/2012.01172 (2020) - [i9]Jordi Zomer, Nikola Besinovic, Mathijs Michiel de Weerdt, Rob M. P. Goverde:
The Maintenance Location Choice Problem for Railway Rolling Stock. CoRR abs/2012.04565 (2020)
2010 – 2019
- 2019
- [j13]Lei He, Arthur Guijt, Mathijs de Weerdt, Lining Xing, Neil Yorke-Smith:
Order acceptance and scheduling with sequence-dependent setup times: A new memetic algorithm and benchmark of the state of the art. Comput. Ind. Eng. 138 (2019) - [c65]Lei He, Mathijs de Weerdt, Neil Yorke-Smith:
Tabu-Based Large Neighbourhood Search for Time/Sequence-Dependent Scheduling Problems with Time Windows. ICAPS 2019: 186-194 - [c64]Grigory Neustroev, Mathijs de Weerdt, Remco A. Verzijlbergh:
Discovery of Optimal Solution Horizons in Non-Stationary Markov Decision Processes with Unbounded Rewards. ICAPS 2019: 292-300 - [c63]Pim van den Bogaerdt, Mathijs de Weerdt:
Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams. CPAIOR 2019: 565-580 - [i8]Lei He, Arthur Guijt, Mathijs de Weerdt, Lining Xing, Neil Yorke-Smith:
Order Acceptance and Scheduling with Sequence-dependent Setup Times: a New Memetic Algorithm and Benchmark of the State of the Art. CoRR abs/1910.01982 (2019) - [i7]Laurens Bliek, Sicco Verwer, Mathijs de Weerdt:
Black-box Combinatorial Optimization using Models with Integer-valued Minima. CoRR abs/1911.08817 (2019) - 2018
- [j12]Jaume Jordán, Alejandro Torreño, Mathijs de Weerdt, Eva Onaindia:
A better-response strategy for self-interested planning agents. Appl. Intell. 48(4): 1020-1040 (2018) - [j11]Pim van den Bogaerdt, Mathijs de Weerdt:
Multi-machine scheduling lower bounds using decision diagrams. Oper. Res. Lett. 46(6): 616-621 (2018) - [c62]Frits de Nijs, Matthijs T. J. Spaan, Mathijs Michiel de Weerdt:
Preallocation and Planning Under Stochastic Resource Constraints. AAAI 2018: 4662-4669 - [c61]Marieke S. van der Tuin, Mathijs de Weerdt, G. Veit Batz:
Route Planning with Breaks and Truck Driving Bans Using Time-Dependent Contraction Hierarchies. ICAPS 2018: 356-365 - [c60]Frits de Nijs, Georgios Theocharous, Nikos Vlassis, Mathijs Michiel de Weerdt, Matthijs T. J. Spaan:
Capacity-aware Sequential Recommendations. AAMAS 2018: 416-424 - [c59]Mathijs Michiel de Weerdt, Michael Albert, Vincent Conitzer, Koos van der Linden:
Complexity of Scheduling Charging in the Smart Grid. AAMAS 2018: 1924-1926 - [c58]Mathijs de Weerdt, Michael Albert, Vincent Conitzer, Koos van der Linden:
Complexity of Scheduling Charging in the Smart Grid. IJCAI 2018: 4736-4742 - [e1]Mathijs de Weerdt, Sven Koenig, Gabriele Röger, Matthijs T. J. Spaan:
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018, Delft, The Netherlands, June 24-29, 2018. AAAI Press 2018, ISBN 978-1-57735-797-1 [contents] - 2017
- [c57]Frits de Nijs, Erwin Walraven, Mathijs Michiel de Weerdt, Matthijs T. J. Spaan:
Bounding the Probability of Resource Constraint Violations in Multi-Agent MDPs. AAAI 2017: 3562-3568 - [c56]Gleb Polevoy, Mathijs de Weerdt:
Competition Between Cooperative Projects. BNCAI 2017: 16-31 - [c55]Gleb Polevoy, Mathijs de Weerdt:
Reciprocation Effort Games. BNCAI 2017: 46-60 - [i6]Mathijs de Weerdt, Michael Albert, Vincent Conitzer:
Complexity of Scheduling Charging in the Smart Grid. CoRR abs/1709.07480 (2017) - 2016
- [j10]Mathijs Michiel de Weerdt, Sebastian Stein, Enrico H. Gerding, Valentin Robu, Nicholas R. Jennings:
Intention-Aware Routing of Electric Vehicles. IEEE Trans. Intell. Transp. Syst. 17(5): 1472-1482 (2016) - [c54]Joris Scharpff, Diederik M. Roijers, Frans A. Oliehoek, Matthijs T. J. Spaan, Mathijs Michiel de Weerdt:
Solving Transition-Independent Multi-Agent MDPs with Sparse Interactions. AAAI 2016: 3174-3180 - [c53]Jasper Hoogland, Mathijs de Weerdt, Han La Poutré:
Now, Later, or Both: A Closed-Form Optimal Decision for a Risk-Averse Buyer. AMEC/TADA 2016: 81-95 - [c52]Mathijs Michiel de Weerdt, Enrico H. Gerding, Sebastian Stein:
Minimising the Rank Aggregation Error: (Extended Abstract). AAMAS 2016: 1375-1376 - [c51]Gleb Polevoy, Mathijs de Weerdt, Catholijn M. Jonker:
The Convergence of Reciprocation: (Extended Abstract). AAMAS 2016: 1431-1432 - [c50]Gleb Polevoy, Mathijs de Weerdt, Catholijn M. Jonker:
The Game of Reciprocation Habits. ECAI 2016: 417-425 - [c49]Frits de Nijs, Matthijs T. J. Spaan, Mathijs Michiel de Weerdt:
Decoupling a Resource Constraint Through Fictitious Play in Multi-Agent Sequential Decision Making. ECAI 2016: 1724-1725 - [c48]Rens Philipsen, Germán Morales-España, Mathijs de Weerdt, Laurens de Vries:
Imperfect Unit Commitment decisions with perfect information: A real-time comparison of energy versus power. PSCC 2016: 1-7 - [i5]Gleb Polevoy, Mathijs de Weerdt, Catholijn M. Jonker:
Towards Decision Support in Reciprocation. CoRR abs/1601.07965 (2016) - 2015
- [c47]Frits de Nijs, Matthijs T. J. Spaan, Mathijs de Weerdt:
Best-Response Planning of Thermostatically Controlled Loads under Power Constraints. AAAI 2015: 615-621 - [c46]Jasper Hoogland, Mathijs de Weerdt, Han La Poutré:
Now, Later, or Both: A Closed-Form Optimal Decision for a Risk-Averse Buyer. AAMAS 2015: 1769-1770 - [c45]Jasper Hoogland, Mathijs de Weerdt, Han La Poutré:
Winning in Retail Market Games: Relative Profit and Logit Demand. SSCI 2015: 1794-1800 - [i4]Joris Scharpff, Diederik M. Roijers, Frans A. Oliehoek, Matthijs T. J. Spaan, Mathijs de Weerdt:
Solving Transition-Independent Multi-agent MDPs with Sparse Interactions (Extended version). CoRR abs/1511.09047 (2015) - 2014
- [j9]Mathijs Michiel de Weerdt, Paul Harrenstein, Vincent Conitzer:
Strategy-proof contract auctions and the role of ties. Games Econ. Behav. 86: 405-420 (2014) - [c44]Diederik Marijn Roijers, Joris Scharpff, Matthijs T. J. Spaan, Frans A. Oliehoek, Mathijs de Weerdt, Shimon Whiteson:
Bounded Approximations for Linear Multi-Objective Planning Under Uncertainty. ICAPS 2014 - [c43]Philipp Ströhle, Enrico H. Gerding, Mathijs de Weerdt, Sebastian Stein, Valentin Robu:
Online mechanism design for scheduling non-preemptive jobs under uncertain supply and demand. AAMAS 2014: 437-444 - [c42]Gleb Polevoy, Stojan Trajanovski, Mathijs de Weerdt:
Nash equilibria in shared effort games. AAMAS 2014: 861-868 - [c41]Thomas Christopher King, Qingzhi Liu, Gleb Polevoy, Mathijs de Weerdt, Virginia Dignum, M. Birna van Riemsdijk, Martijn Warnier:
Request driven social sensing. AAMAS 2014: 1651-1652 - [c40]Gleb Polevoy, Mathijs de Weerdt:
Improving human interaction in crowdsensing. AAMAS 2014: 1741-1742 - [i3]Léon Planken, Mathijs Michiel de Weerdt, Roman van der Krogt:
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth. CoRR abs/1401.4609 (2014) - [i2]Jan Elffers, Mathijs de Weerdt:
Scheduling with two non-unit task lengths is NP-complete. CoRR abs/1412.3095 (2014) - 2013
- [c39]Joris Scharpff, Matthijs T. J. Spaan, Leentje Volker, Mathijs de Weerdt:
Planning under Uncertainty for Coordinating Infrastructural Maintenance. ICAPS 2013 - [c38]Joris Scharpff, Matthijs T. J. Spaan, Leentje Volker, Mathijs de Weerdt:
Coordinating maintenance planning under uncertainty: (demonstration). AAMAS 2013: 1405-1406 - [c37]Mathijs Michiel de Weerdt, Enrico H. Gerding, Sebastian Stein, Valentin Robu, Nicholas R. Jennings:
Intention-aware routing to minimise delays at electric vehicle charging stations: the research related to this demonstration has been published at IJCAI 2013 [1]. AIIP/Semantic Cities@IJCAI 2013: 57 - [c36]Mathijs Michiel de Weerdt, Enrico H. Gerding, Sebastian Stein, Valentin Robu, Nicholas R. Jennings:
Intention-Aware Routing to Minimise Delays at Electric Vehicle Charging Stations. IJCAI 2013: 83-89 - 2012
- [j8]Mathijs de Weerdt, Yingqian Zhang, Tomas Klos:
Multiagent task allocation in social networks. Auton. Agents Multi Agent Syst. 25(1): 46-86 (2012) - [j7]Léon Planken, Mathijs de Weerdt, Roman van der Krogt:
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth. J. Artif. Intell. Res. 43: 353-388 (2012) - [j6]Sicco Verwer, Mathijs de Weerdt, Cees Witteveen:
Efficiently identifying deterministic real-time automata from labeled data. Mach. Learn. 86(3): 295-333 (2012) - [c35]Arman Noroozian, Mathijs de Weerdt, Cees Witteveen:
Incentivizing Cooperation in P2P File Sharing - Indirect Interaction as an Incentive to Seed. ADMI 2012: 36-50 - 2011
- [j5]Sicco Verwer, Mathijs de Weerdt, Cees Witteveen:
The efficiency of identifying timed automata and the power of clocks. Inf. Comput. 209(3): 606-625 (2011) - [c34]Léon Planken, Mathijs de Weerdt, Roman van der Krogt:
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth. ICAPS 2011 - [c33]Mengxiao Wu, Mathijs de Weerdt, Han La Poutré:
Acceptance Strategies for Maximizing Agent Profits in Online Scheduling. AMEC/TADA 2011: 115-128 - [c32]Tamás Máhr, Faith Jordan Srour, Mathijs de Weerdt:
Using simulation to evaluate how multi-agent transportation planners cope with truck breakdowns. ICNSC 2011: 139-144 - [c31]Sicco Verwer, Mathijs de Weerdt, Cees Witteveen:
Learning Driving Behavior by Timed Syntactic Pattern Recognition. IJCAI 2011: 1529-1534 - 2010
- [c30]Léon Planken, Mathijs de Weerdt, Neil Yorke-Smith:
Incrementally Solving STNs by Enforcing Partial Path Consistency. ICAPS 2010: 129-136 - [c29]Léon Planken, Mathijs de Weerdt, Cees Witteveen:
Optimal temporal decoupling in multiagent systems. AAMAS 2010: 789-796 - [c28]Sicco Verwer, Mathijs de Weerdt, Cees Witteveen:
A Likelihood-Ratio Test for Identifying Probabilistic Deterministic Real-Time Automata from Positive Data. ICGI 2010: 203-216 - [c27]Ferdi Grootenboers, Mathijs de Weerdt, Mahdi Zargayouna:
Impact of Competition on Quality of Service in Demand Responsive Transit. MATES 2010: 113-124
2000 – 2009
- 2009
- [j4]Mathijs de Weerdt, Brad Clement:
Introduction to planning in multiagent systems. Multiagent Grid Syst. 5(4): 345-355 (2009) - [c26]Koen V. Hindriks, Dmytro Tykhonov, Mathijs de Weerdt:
Approximating the Qualitative Vickrey Auction by a Negotiation Protocol. AMEC/TADA 2009: 44-57 - [c25]Behnam Jalilzadeh, Léon Planken, Mathijs de Weerdt:
Mechanism Design for the Online Allocation of Items without Monetary Payments. AMEC/TADA 2009: 74-87 - [c24]Yingqian Zhang, Mathijs de Weerdt:
Creating Incentives to Prevent Intentional Execution Failures. IAT 2009: 431-434 - [c23]Sicco Verwer, Mathijs de Weerdt, Cees Witteveen:
One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit. LATA 2009: 740-751 - [c22]Mengxiao Wu, Mathijs de Weerdt, Han La Poutré:
Efficient Methods for Multi-agent Multi-issue Negotiation: Allocating Resources. PRIMA 2009: 97-112 - [c21]Paul Harrenstein, Mathijs de Weerdt, Vincent Conitzer:
A qualitative vickrey auction. EC 2009: 197-206 - [p1]Tamás Máhr, F. Jordan Srour, Mathijs de Weerdt, Rob A. Zuidwijk:
The Merit of Agents in Freight Transport. Multi-Agent Systems for Traffic and Transportation Engineering 2009: 323-341 - 2008
- [c20]Léon Planken, Mathijs de Weerdt, Roman van der Krogt:
P3C: A New Algorithm for the Simple Temporal Problem. ICAPS 2008: 256-263 - [c19]Mathijs de Weerdt, Yingqian Zhang:
Preventing Under-Reporting in Social Task Allocation. AMEC/TADA 2008: 1-14 - [c18]Roman van der Krogt, Mathijs de Weerdt, Yingqian Zhang:
Of Mechanism Design Multiagent Planning. ECAI 2008: 423-427 - [c17]Koen V. Hindriks, Dmytro Tykhonov, Mathijs de Weerdt:
Approximating an auction mechanism by multi-issue negotiation. HuCom 2008: 33-38 - [c16]Sicco Verwer, Mathijs de Weerdt, Cees Witteveen:
Polynomial Distinguishability of Timed Automata. ICGI 2008: 238-251 - [i1]Yingqian Zhang, Mathijs de Weerdt:
Creating incentives to prevent execution failures: an extension of VCG mechanism. Planning in Multiagent Systems 2008 - 2007
- [c15]Mathijs de Weerdt, Yingqian Zhang, Tomas Klos:
Distributed task allocation in social networks. AAMAS 2007: 76 - [c14]Ruben Stranders, Mathijs de Weerdt, Cees Witteveen:
Fuzzy Argumentation for Trust. CLIMA 2007: 214-230 - [c13]Tamás Máhr, Mathijs de Weerdt:
Auctions with Arbitrary Deals. HoloMAS 2007: 37-46 - 2006
- [c12]Mathijs de Weerdt, Cees Witteveen:
Multiagent Planning: Problem Properties that Matter. AAAI Spring Symposium: Distributed Plan and Schedule Management 2006: 155-156 - [c11]Cees Witteveen, Mathijs de Weerdt:
Multi-Agent Planning for Non-Cooperative Agents. AAAI Spring Symposium: Distributed Plan and Schedule Management 2006: 169- - 2005
- [c10]Roman van der Krogt, Mathijs de Weerdt:
Plan Repair as an Extension of Planning. ICAPS 2005: 161-170 - [c9]Tamás Máhr, Mathijs de Weerdt:
Distributed agent platform for Advanced Logistics. AAMAS 2005: 155-156 - [c8]Cees Witteveen, Nico Roos, Roman van der Krogt, Mathijs de Weerdt:
Diagnosis of single and multi-agent plans. AAMAS 2005: 805-812 - [c7]Roman van der Krogt, Nico Roos, Mathijs de Weerdt, Cees Witteveen:
Multiagent planning through plan repair. AAMAS 2005: 1337-1338 - [c6]Roman van der Krogt, Mathijs de Weerdt:
Plan Repair using a Plan Library. BNAIC 2005: 284-259 - [c5]Sicco Verwer, Mathijs de Weerdt, Cees Witteveen:
Timed Inference for Behavioral Pattern Recognition. BNAIC 2005: 291-296 - [c4]Roman van der Krogt, Mathijs de Weerdt:
Coordination through Plan Repair. EUMAS 2005: 509-510 - [c3]Roman van der Krogt, Mathijs de Weerdt:
Coordination Through Plan Repair. MICAI 2005: 264-274 - 2003
- [j3]Mathijs de Weerdt, André Bos, Hans Tonino, Cees Witteveen:
A Resource Logic for Multi-Agent Plan Merging. Ann. Math. Artif. Intell. 37(1-2): 93-130 (2003) - [j2]Roman van der Krogt, Mathijs de Weerdt, Cees Witteveen:
A resource based framework for planning and replanning. Web Intell. Agent Syst. 1(3-4): 173-186 (2003) - [c2]Roman van der Krogt, Mathijs de Weerdt, Cees Witteveen:
A Resource Based Framework for Planning and Replanning. IAT 2003: 247-253 - 2002
- [j1]Hans Tonino, André Bos, Mathijs de Weerdt, Cees Witteveen:
Plan coordination by revision in collective agent based systems. Artif. Intell. 142(2): 121-145 (2002) - 2000
- [c1]Mathijs de Weerdt, André Bos, Hans Tonino, Cees Witteveen:
A Plan Fusion Algorithm for Multi-Agent Systems. CL-2000 Workshop on Computational Logic in Multi-Agent Systems 2000: 56-65
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
