Concurrency in heavily loaded neighborhood-constrained systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Randomized generation of acyclic orientations upon anonymous distributed systems
Journal of Parallel and Distributed Computing
Web marshals fighting curly link farms
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
A distributed dynamics for webgraph decontamination
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
A novel distributed scheduling algorithm for resource sharing under near-heavy load
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Cleaning an arbitrary regular network with mobile agents
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Hi-index | 0.00 |
Searching for intelligent escaping agents constitutes an interesting and hard problem. The use of multiple agents in the search involves decentralized coordination. This paper presents a novel solution for the problem of distributed search proposing SERs, a variant for the mechanism of Scheduling by Edge Reversal. The mechanism was applied to search for agents with four different types of behavior. Experimental results are presented for the evaluation of efficiency and scalability of the mechanism according to the studied types of behavior and sensor range, among other parameters.