Sciweavers

224 search results - page 34 / 45
» Quick-and-dirty ant colony optimization
Sort
View
COR
2007
80views more  COR 2007»
13 years 7 months ago
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
In this paper we present an ant-based algorithm for solving unconstrained multi-level lot-sizing problems called ant system for multi-level lot-sizing algorithm (ASMLLS). We apply...
Rapeepan Pitakaso, Christian Almeder, Karl F. Doer...
ADHOC
2008
183views more  ADHOC 2008»
13 years 7 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
ANTSW
2006
Springer
13 years 11 months ago
An Energy-Efficient Ant-Based Routing Algorithm for Wireless Sensor Networks
Abstract. Wireless Sensor Networks are characterized by having specific requirements such as limited energy availability, low memory and reduced processing power. On the other hand...
Tiago Camilo, Carlos Carreto, Jorge Sá Silv...
CISIS
2008
IEEE
14 years 2 months ago
Hardware Software Partitioning Problem in Embedded System Design Using Particle Swarm Optimization Algorithm
Hardware/software partitioning is a crucial problem in embedded system design. In this paper, we provide an alternative approach to solve this problem using Particle Swarm Optimiz...
Alakananda Bhattacharya, Amit Konar, Swagatam Das,...
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
14 years 1 months ago
Bayesian optimization models for particle swarms
We explore the use of information models as a guide for the development of single objective optimization algorithms, giving particular attention to the use of Bayesian models in a...
Christopher K. Monson, Kevin D. Seppi