4131 search results - page 410 / 827 » Compactness in Topology and Computation |
161
click to vote
ICRA
2005
IEEE
16 years 13 days ago
2005
IEEE
— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
163
click to vote
EUROPAR
2005
Springer
16 years 11 days ago
2005
Springer
In this paper we introduce INSEE, an environment to help in the design of interconnection networks for parallel computing systems. It contains two basic modules: a system to genera...
114
click to vote
ICCSA
2005
Springer
16 years 11 days ago
2005
Springer
Multireference configuration interaction calculations have been performed on the excited state energy surfaces of the methyleneimmonium cation using recently developed methods for ...
182
click to vote
IPSN
2005
Springer
16 years 10 days ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
256
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...