Sciweavers

1484 search results - page 89 / 297
» Ants meeting algorithms
Sort
View
ANTSW
2006
Springer
14 years 2 months ago
An Estimation of Distribution Particle Swarm Optimization Algorithm
Abstract. In this paper we present an estimation of distribution particle swarm optimization algorithm that borrows ideas from recent developments in ant colony optimization. In th...
Mudassar Iqbal, Marco Antonio Montes de Oca
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
14 years 2 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang
PLDI
2012
ACM
12 years 20 days ago
Reagents: expressing and composing fine-grained concurrency
Efficient communication and synchronization is crucial for finegrained parallelism. Libraries providing such features, while indispensable, are difficult to write, and often ca...
Aaron Turon
IPPS
2008
IEEE
14 years 4 months ago
Portioned static-priority scheduling on multiprocessors
This paper proposes an efficient real-time scheduling algorithm for multiprocessor platforms. The algorithm is a derivative of the Rate Monotonic (RM) algorithm, with its basis on...
Shinpei Kato, Nobuyuki Yamasaki
AGENTS
2001
Springer
14 years 2 months ago
Automatically tracking and analyzing the behavior of live insect colonies
We introduce the study of live social insect colonies as a relevant and exciting domain for the development and application of multi-agent systems modeling tools. Social insects p...
Tucker R. Balch, Zia Khan, Manuela M. Veloso