Sciweavers

1368 search results - page 165 / 274
» Perfect Local Computability and Computable Simulations
Sort
View
INFOCOM
1996
IEEE
15 years 6 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Fred Bauer, Anujan Varma
ESANN
2006
15 years 3 months ago
Unsupervised clustering of continuous trajectories of kinematic trees with SOM-SD
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
Jochen J. Steil, Risto Koiva, Alessandro Sperduti
AE
2009
Springer
15 years 2 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
JRTIP
2007
132views more  JRTIP 2007»
15 years 1 months ago
Real-time stabilization of long range observation system turbulent video
The paper presents a real-time algorithm that compensates image distortions due to atmospheric turbulence in video sequences, while keeping the real moving objects in the video unh...
Barak Fishbain, Leonid P. Yaroslavsky, Ianir A. Id...
AROBOTS
2002
130views more  AROBOTS 2002»
15 years 1 months ago
Dynamic Motion Planning for Mobile Robots Using Potential Field Method
The potential field method is widely used for autonomous mobile robot path planning due to its elegant mathematical analysis and simplicity. However, most researches have been focu...
Shuzhi Sam Ge, Youjing Cui