Multiple helper scripts have been used to generate the graphs used to test the algorithms. graph_generation/main.cpp: generate a random 2D graph, in a square grid of size S*S with N nodes, each ...

We introduce a novel programming algorithm that is particularly suitable for 3D NAND. With larger design rules and charge trapping (CT) device 3D NAND is much less sensitive to interference therefore ...

We present a conceptual abstraction layer dedicated to unify the interface to hardware devices capable of performing ranging as well as dedicated to evaluate the positioning algorithms working on top.