1099 search results - page 196 / 220 » On the Complexity of Computing Evolutionary Trees |
105
click to vote
KES
1999
Springer
15 years 2 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
A major challenge for traditional approaches to multiagent learning is to train teams that easily scale to include additional agents. The problem is that such approaches typically...
BMCBI
2010
14 years 10 months ago
2010
Background: Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore ...
GPEM
2008
14 years 9 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
DSN
2002
IEEE
15 years 2 months ago
2002
IEEE
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...