14774 search results - page 172 / 2955 » Computational complexity and evolutionary computation |
151
click to vote
IJCAI
1993
15 years 5 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
121
click to vote
MOC
2010
14 years 11 months ago
2010
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...
145
click to vote
JFP
2000
15 years 4 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
159
click to vote
ECAL
1995
Springer
15 years 8 months ago
1995
Springer
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
143
click to vote
ALIFE
2005
15 years 4 months ago
2005
Deacon has recently proposed that complexes of genes can be integrated into functional groups as a result of environmental changes that mask and unmask selection pressures. For exa...