87 search results - page 5 / 18 » Roughness bounds in rough set operations |
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this video, we demonstrate the effectiveness of a kinodynamic planning strategy that allows a high-impedance quadruped to operate across a variety of rough terrain. At one e...
RSCTC
2004
Springer
15 years 2 months ago
2004
Springer
We study properties of infomorphisms between information systems. In particular, we interpret infomorphisms between information systems in terms of sums with constraints (constrain...
COLOGNETWENTE
2010
14 years 8 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
RSCTC
1998
Springer
15 years 1 months ago
1998
Springer
This paper reviews and discusses generalizations of Pawlak rough set approximation operators in mathematical systems, such as topological spaces, closure systems, lattices, and pos...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...