We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...
Background: In recent years protein structure prediction methods using local structure information have shown promising improvements. The quality of new fold predictions has risen...
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
This paper addresses the problem of seeking out parts of the environment that provide adequate features in order to perform robot localization. The objective is to choose good regi...