Sciweavers

16091 search results - page 67 / 3219
» Solving
Sort
View
GECCO
2003
Springer
201views Optimization» more  GECCO 2003»
15 years 11 months ago
Solving Mastermind Using Genetic Algorithms
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
Tom Kalisker, Doug Camens
IWANN
2001
Springer
15 years 10 months ago
Solving NP-Complete Problems With Networks of Evolutionary Processors
We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in [4], called network of evolutionary processors. An ...
Juan Castellanos, Carlos Martín-Vide, Victo...
DARS
2000
Springer
141views Robotics» more  DARS 2000»
15 years 10 months ago
Cooperation of Multiple Robots to Solve Maze Tasks
This paper discusses the use of cooperation and distributed intelligence within a robot team to solve a maze problem in which a set of ordered control point tasks has to be perform...
C. R. F. Costa, Eliana P. L. Aude
ECAIW
2000
Springer
15 years 10 months ago
Solving the Sports League Scheduling Problem with Tabu Search
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisf...
Jean-Philippe Hamiez, Jin-Kao Hao
IPPS
1999
IEEE
15 years 10 months ago
Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
Takayuki Suyama, Makoto Yokoo, Akira Nagoya