Sciweavers

446 search results - page 22 / 90
» Using a genetic algorithm approach to solve the dynamic chan...
Sort
View
SIGADA
2004
Springer
14 years 2 months ago
Comparative analysis of genetic algorithm implementations
Genetic Algorithms provide computational procedures that are modeled on natural genetic system mechanics, whereby a coded solution is “evolved” from a set of potential solutio...
Robert Soricone, Melvin Neville
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
13 years 6 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...
ECP
1997
Springer
128views Robotics» more  ECP 1997»
14 years 24 days ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
14 years 2 months ago
Lagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
Yong-Hyuk Kim, Byung Ro Moon
DIGRA
2005
Springer
14 years 2 months ago
Realistic Agent Movement in Dynamic Game Environments
One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core...
Ross Graham, Hugh McCabe, Stephen Sheridan