Titlebook: Applications of Evolutionary Computing; EvoWorkshops 2007:Ev Mario Giacobini Conference proceedings 2007 Springer-Verlag Berlin Heidelberg

rods366

Design of a User Space Software Suite for Probabilistic Routing in Ad-Hoc Networks in C and runs completely in user space. This, together with its modular structure, makes it easy to adapt and extend with new algorithms. MagAntA makes use of the Ana4 framework [3], a set of kernel modules that provide the necessary functionalities to support ad hoc mesh networking and facilitate

不可磨滅

cuticle

Modify

Simplified Transformer Winding Modelling and Parameter Identification Using Particle Swarm Optimisermulticonductor transmission line theories. The simplified model is applied to the FRA simulation of a transformer winding. In order to identify the distributed parameters of the model, an intelligent learning technique, rooted from particle swarm optimiser with passive congregation (PSOPC) is utilis

Cognizance

A Decentralized Hierarchical Aggregation Scheme Using Fermat Points in Wireless Sensor Networksthe Fermat points to save energy for transmitting redundant low-rate data on many-to-one flows in wireless sensor networks. It can reduce the number of transmissions needed to deliver from each source to the sink. Simulation results show that our scheme is better than the GIT (Greedy Incremental Tre

Cerumen

A Gateway Access-Point Selection Problem and Traffic Balancing in Wireless Mesh Networksom the Internet are aggregated and go through the limited number of gateway APs. The meshed topology provides good reliability, market coverage, and scalability, as well as low upfront investment. However, due to the nature of routing algorithm the traffic load for a access point may be extremely he

Firefly

開(kāi)始發(fā)作

Assignment

An Ant Algorithm for the Steiner Tree Problem in Graphsfollows: each ant is a constructive heuristic close to TM, but the population of ants can collaborate by exchanging information by the use of the trail systems. In addition, the decision rule used by each individual ant is different from the decision rule used in TM. We compare TM and ANT-STP on a set of benchmark problems of the OR-Library.

SKIFF