Abstract: A novel self-organizing algorithm for conformational sampling is introduced, in which precomputed conformations of rigid fragments are used as templates to enforce the de...
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
Future planetary exploration missions will use cooperative robots to explore and sample rough terrain. To succeed robots will need to cooperatively acquire and share data. Here a c...
Vivek A. Sujan, Steven Dubowsky, Terrance L. Hunts...
We consider the ICP (iterative closest point) algorithm, which may in general be used for moving `active' elements such as curves and surfaces towards geometric objects whose...
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...