Sciweavers

1368 search results - page 5 / 274
» Perfect Local Computability and Computable Simulations
Sort
View
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
15 years 3 months ago
Locally Computable Navigation Functions for Sphere Worlds
Abstract— In this paper we present a new Navigation Function for a sphere world that can be computed locally with limited knowledge of the environment. By requiring smooth and no...
Grigoris Lionis, Xanthi Papageorgiou, Kostas J. Ky...
ICCNMC
2005
Springer
15 years 3 months ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman
83
Voted
ICANN
2007
Springer
15 years 3 months ago
Event Detection and Localization in Mobile Robot Navigation Using Reservoir Computing
Abstract. Reservoir Computing (RC) uses a randomly created recurrent neural network where only a linear readout layer is trained. In this work, RC is used for detecting complex eve...
Eric A. Antonelo, Benjamin Schrauwen, Xavier Dutoi...
JCC
2002
127views more  JCC 2002»
14 years 9 months ago
Effective Born radii in the generalized Born approximation: The importance of being perfect
: Generalized Born (GB) models provide, for many applications, an accurate and computationally facile estimate of the electrostatic contribution to aqueous solvation. The GB models...
Alexey Onufriev, David A. Case, Donald Bashford
ICRA
2008
IEEE
104views Robotics» more  ICRA 2008»
15 years 4 months ago
Towards locally computable polynomial navigation functions for convex obstacle workspaces
— In this paper we present a polynomial Navigation Function (NF) for a sphere world that can be constructed almost locally, with partial knowledge of the environment. The present...
Grigoris Lionis, Xanthi Papageorgiou, Kostas J. Ky...