Sciweavers

1191 search results - page 83 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
ATAL
2008
Springer
14 years 7 days ago
A coordination mechanism for swarm navigation: experiments and analysis
We present an algorithm that allows swarms of robots to navigate in environments containing unknown obstacles, moving towards and spreading along 2D shapes given by implicit funct...
Leandro Soriano Marcolino, Luiz Chaimowicz
IJNM
2008
131views more  IJNM 2008»
13 years 10 months ago
Using temporal correlation for fault localization in dynamically changing networks
A mobile ad-hoc network creates a dynamic environment where node mobility can cause periodic changes in routes. Most existing fault localization algorithms assume availability of ...
Maitreya Natu, Adarshpal S. Sethi
DAM
1999
132views more  DAM 1999»
13 years 10 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
SAINT
2005
IEEE
14 years 3 months ago
Easing the Transition to IPv6
This paper presents the "auto-transition" concept which tries to ensure that any network device can obtain IPv6 connectivity at any time and whatever network is attached...
Miguel Angel Díaz, Jordi Palet
AI
2003
Springer
14 years 3 months ago
Efficient Mining of Indirect Associations Using HI-Mine
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An