Introduction to algorithms
PVM: a framework for parallel distributed computing
Concurrency: Practice and Experience
The point-to-point delivery and connection problems: complexity and algorithms
Discrete Applied Mathematics
Asynchronous organizations for multi-algorithm problems
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Network loading and connection problems
Network loading and connection problems
An introduction to distributed algorithms
An introduction to distributed algorithms
Computer Networking: A Top-Down Approach Featuring the Internet : Preliminary Edtion
Computer Networking: A Top-Down Approach Featuring the Internet : Preliminary Edtion
Asynchronous Organizations for Solving the Point-to-Point Connection Problem
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Web Accessible A-Team Middleware
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part III
A-Team Middleware on a Cluster
KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
A-Teams and Their Applications
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Dominating sets of agents in visibility graphs: distributed algorithms for art gallery problems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
JABAT middleware as a tool for solving optimization problems
Transactions on computational collective intelligence II
Hi-index | 0.00 |
We propose a parallel and asynchronous approach to give near-optimal solutions to the non-fixed point-to-point connection problem, This problem is NP-hard and has practical applications in multicast routing. The technique adopted to solve the problem is an organization of heuristics that communicate with each other by means of a virtually shared memory. This technique is called A-Teams (for Asynchronous Teams). The virtual shared memory is implemented in a physically distributed memory system. Computational results comparing our approach with a branch-and-cut algorithm are presented.