Titlebook: Applications of Evolutionary Computing; EvoWorkshops 2009: E Mario Giacobini,Anthony Brabazon,Penousal Machado Conference proceedings 2009

思想

Multiuser Scheduling in HSDPA with Particle Swarm Optimizationassumed, as specified in the HSDPA standard [1]. A global optimal approach and a particle swarm optimization approach are used to solve the problem. Simulation results indicate that the performances of the two approaches are very close even though the complexity of the particle swarm optimization approach is much lower.

gain631

cipher

Ant Routing with Distributed Geographical Localization of Knowledge in Ad-Hoc Networksheromone by real ants: the pheromone is left on the ground and used by ants in its surroundings. Our experiments show that the proposed solution may improve the overall performance of the underlying ant routing mechanism.

Collar

Inelasticity

Adaptive Land-Use Management in Dynamic Ecological Systemical environments, which in turn have many impacts on land-use decisions. This work demonstrates how evolutionary algorithms generate land-use strategies in dynamic biological environments over time. It also illustrates the influences on sheep grazing from banning managed burning in a study site.

Hamper

Howard R. Champion FRCS (Edin) FACSEP is used to find a function used for classification of SQL queries. Experimental results are presented on the basis of SQL queries of different length. The findings show that the efficiency of detecting SQL statements representing attacks depends on the length of SQL statements.

Exposition

Encyclopedia of Intensive Care Medicinehe estimations, propose a two-stage Simulated Annealing to solve the LD problem using this model, and discuss the results obtained. We will put a special stress on the improvements obtained by using our proposed technique.

lattice

Howard R. Champion FRCS (Edin) FACSction by the heuristics and a proper reinforcement proportion to the destination nodes is studied in the case experiments. Three types of heuristics are tested, and the results show that a modest heuristic reinforcement to the destination nodes can accelerate the convergence of the algorithm and achieve better results.

奴才

Devastate