output
20132024
most citedResearch trends in combinatorial optimisation

43 citations

Showing 2018Show all

5 papers · 1 filter

cs.PF2018

Global attraction of ODE-based mean field models with hyperexponential job sizes

Benny Van Houdt

Mean field modeling is a popular approach to assess the performance of large scale computer systems. The evolution of many mean field models is characterized by a set of ordinary d…

cs.DC2018

Randomized Work Stealing versus Sharing in Large-scale Systems with Non-exponential Job Sizes

Benny Van Houdt

Work sharing and work stealing are two scheduling paradigms to redistribute work when performing distributed computations. In work sharing, processors attempt to migrate pending jo…

cs.PF2018

On the Power-of-d-choices with Least Loaded Server Selection

Tim Hellemans, Benny Van Houdt

Motivated by distributed schedulers that combine the power-of-d-choices with late binding and systems that use replication with cancellation-on-start, we study the performance of t…

astro-ph.IM2018★ 5 cited

A novel technique to characterize the spatial intra-pixel sensitivity variations in a CMOS image sensor

Swaraj Mahato, J. De Ridder, Guy Meynants +2

To understand the scientific imaging capability, one must characterize the intra-pixel sensitivity variation (IPSV) of the CMOS image sensor. Extracting an IPSV map contributes to…

math.GR2018

Generalized characters for glider representations of groups

Frederik Caenepeel, Fred Van Oystaeyen

Glider representations can be defined for a finite algebra filtration FKG determined by a chain of subgroups 1 < G_1 < ... < G_d = G. In this paper we develop the generalized chara…