444 search results - page 65 / 89 » Solving Mastermind Using Genetic Algorithms |
CORR
2004
Springer
13 years 8 months ago
2004
Springer
Evolutionary computation algorithms are increasingly being used to solve optimization problems as they have many advantages over traditional optimization algorithms. In this paper...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
We introduce a new method to estimate the Java object activity in a distributed context of irregular applications. This method uses an observation mechanism which is itself a part...
ICRA
2000
IEEE
2000
IEEE
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
14 years 1 months ago
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
SBIA
1998
Springer
14 years 28 days ago
1998
Springer
This paper presents Darwinci, a system that generates new ideas, using a multi-domain knowledge base composed by musical and drawing structures. Its theoretical background comes fr...