This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
As distributed storage systems grow, the response time between detection and repair of the error becomes significant. Systems built on shared servers have additional complexity be...
Justin M. Wozniak, Paul Brenner, Douglas Thain, Aa...
Many scientific and engineering applications involve inverting large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for d...
Simon Branford, Cihan Sahin, Ashish Thandavan, Chr...
An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point remov...