Demo Data from EDBT 2026 / reviewers in the wild / expert
Gerrit K. Janssens
dblp:35/798
· DBLP profile ↗
11ranked-venue papers
7as first author
0since 2021 · last 2019
0000-0002-9857-5130ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 4 · 2 first-authorArtificial intelligence and machine learning · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Performance modeling and evaluation · 100% | |
| Computer networks
1 paper |
Internet architecture and protocols · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Performance modeling and evaluation › queueing models › closed queueing networks
finite-source queueing |
0.0 | 1 | 1997 | The quasi-random input queueing system with repeated attempts as a model for a collision-avoidance star local area network · IEEE Trans. Commun. 1997 |
Performance modeling and evaluation
queueing models |
0.0 | 1 | 1997 | The quasi-random input queueing system with repeated attempts as a model for a collision-avoidance star local area network · IEEE Trans. Commun. 1997 |
Internet architecture and protocols
local area network |
0.0 | 1 | 1997 | The quasi-random input queueing system with repeated attempts as a model for a collision-avoidance star local area network · IEEE Trans. Commun. 1997 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0queueing analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Studying the influence of algorithmic parameters and instance characteristics on the performance of a multiobjective algorithm using the Promethee methodabstractA method is proposed to analyze the effect of the algorithmic parameters and instance characteristics on the quality of a Pareto front produced by a multiobjective algorithm. This method is applied to a variable neighborhood tabu search that is used to solve a multiobjective microzone-based vehicle routing problem. Our method can accommodate many different performance indices for Pareto fronts and uses the Promethee multicriteria decision analysis method to select the best configuration based on the characteristics of the instance being solved. Jochen Janssens, Kenneth Sörensen, Gerrit K. Janssens |
Cybern. Syst. | 3 |
| 2017 | Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraintsabstractIn this article an Iterated Local Search algorithm for the capacitated vehicle routing problem with sequence‐based pallet loading and axle weight constraints is presented. Axle weight limits impose a great challenge for transportation companies. Yet, the literature on the incorporation of axle weight constraints in vehicle routing models is very scarce. The effect of introducing axle weight constraints in a CVRP on total routing cost is analyzed. Results show that integrating axle weight constraints does not lead to a large cost increase. However, not including axle weight constraints in the planning process may induce major axle weight violations. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 69(3), 304–316 2017 Hanne Pollaris, Kris Braekers, An Caris, Gerrit K. Janssens, Sabine Limbourg |
Networks | 4 |
| 2011 | A linear programming formulation for an inventory management decision problem with a service constraint
Gerrit K. Janssens, Katrien Ramaekers |
Expert Syst. Appl. | 1 |
| 2011 | Pareto-optimality of oblique decision trees from evolutionary algorithms
José Maria Pangilinan, Gerrit K. Janssens |
J. Glob. Optim. | 2 |
| 2009 | Time Petri nets as an evaluation tool for handling travel time uncertainty in vehicle routing solutions
Gerrit K. Janssens, An Caris, Katrien Ramaekers |
Expert Syst. Appl. | 1 |
| 2005 | Analysis of Company Growth Data Using Genetic Algorithms on Binary Trees
Gerrit K. Janssens, Kenneth Sörensen, Arthur Limère, Koen Vanhoof |
PAKDD | 1 |
| 2000 | Techniques for Modeling Workflows and Their Support of Reuse
Gerrit K. Janssens, Jan Verelst, Bart Weyn |
Business Process Management | 1 |
| 1999 | Design, performance and wavelength assignment of a wavelength division multiaccess protocol for optical fibre ring networks
Ahmed E. Kamal 0001, Gerrit K. Janssens |
Comput. Networks | 2 |
| 1997 | The quasi-random input queueing system with repeated attempts as a model for a collision-avoidance star local area networkabstractA performance model is developed and validated for a local area network (LAN) with a star topology. A collision-avoidance network access protocol, as implemented in Hubnet, is considered. The model is based on a single server queueing system with finite sources and with a single buffer. Packets arriving at a full buffer retry their access after a fixed time period. Results for an eight-node network are presented and validated by means of earlier obtained simulation results. Gerrit K. Janssens |
IEEE Trans. Commun. | 1 |
| 1994 | Delay time computation for an active star topology local area network
Gerrit K. Janssens |
Microprocess. Microprogramming | 1 |
| 1987 | An Implementation Approach for Local Area Networks
Gerrit K. Janssens, Jan Raes, Dirk Staelens |
Comput. Networks | 1 |