Sciweavers

1484 search results - page 25 / 297
» Ants meeting algorithms
Sort
View
TEC
2002
163views more  TEC 2002»
13 years 7 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
ICOIN
2004
Springer
14 years 1 months ago
Route Reinforcement for Efficient QoS Routing Based on Ant Algorithm
In this paper, we present a new method to calculate reinforcement value in QoS routing algorithm for real-time multimedia based on Ant algorithm to efficiently and effectively rein...
Jae Seuk Oh, Sung-il Bae, Jin-Ho Ahn, Sungho Kang
IJCAI
2007
13 years 9 months ago
An Improved Probabilistic Ant based Clustering for Distributed Databases
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is ...
Chandrasekar Ramachandran, Thanukrishnan Srinivasa...
TEC
2002
152views more  TEC 2002»
13 years 7 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck
ITSSA
2006
91views more  ITSSA 2006»
13 years 7 months ago
Organization Detection Using Emergent Computing
: Organization is a central concept in systems. In this paper an ant algorithm for detecting organizations is presented. In a discrete-time context, at each time-step, an organizat...
Cyrille Bertelle, Antoine Dutot, Fréd&eacut...