Sciweavers

4355 search results - page 115 / 871
» Increasing Kolmogorov Complexity
Sort
View
IROS
2006
IEEE
120views Robotics» more  IROS 2006»
15 years 4 months ago
3D Pose Visual Servoing Relieves Parallel Robot Control from Joint Sensing
— In this paper, we show that visual feedback reduces the complexity of parallel robot Cartesian control. Namely, 3D pose visual servoing, where the end-effector pose is indirect...
Tej Dallej, Nicolas Andreff, Youcef Mezouar, Phili...
IPCCC
2005
IEEE
15 years 3 months ago
A key distribution scheme for double authentication in link state routing protocol
The Double Authentication (DA) scheme presented in [1] is designed to provide security against impersonation attack to link state routing protocol at a lower computational cost as...
D. Huang, A. Sinha, D. Medhi
ITCC
2005
IEEE
15 years 3 months ago
Event-Based Blackboard Architecture for Multi-Agent Systems
Developing large multi-agent systems is a complex task involving the processes of the requirement, architecture, design and implementation of these systems. In particular, the arc...
Jing Dong, Shanguo Chen, Jun-Jang Jeng
MSE
2005
IEEE
153views Hardware» more  MSE 2005»
15 years 3 months ago
ipPROCESS: Using a Process to Teach IP-Core Development
The reusing of Intellectual Property cores has been an alternative to the increasing gap between design productivity and chip complexity of emerging System-on-chip (SoC) designs. ...
Marilia Lima, Andre Aziz, Diogo José Costa ...
ICDCIT
2005
Springer
15 years 3 months ago
Merging Clustering Algorithms in Mobile Ad Hoc Networks
Abstract. Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a n...
Orhan Dagdeviren, Kayhan Erciyes, Deniz Cokuslu