Sciweavers

57 search results - page 1 / 12
» A genetic algorithm for solving the binning problem in netwo...
Sort
View
CEC
2007
IEEE
13 years 11 months ago
A genetic algorithm for solving the binning problem in networked applications detection
Network administrators need a tool that detects the kind of applications running on their networks, in order to allocate resources and enforce security policies. Previous work sho...
Maxim Shevertalov, Edward Stehle, Spiros Mancoridi...
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
13 years 11 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
ASIAMS
2007
IEEE
13 years 11 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
13 years 10 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
JCM
2006
144views more  JCM 2006»
13 years 5 months ago
Using Micro-Genetic Algorithms to Improve Localization in Wireless Sensor Networks
Wireless sensor networks are widely adopted in many location-sensitive applications including disaster management, environmental monitoring, military applications where the precise...
Vincent Tam, King-Yip Cheng, King-Shan Lui