1099 search results - page 59 / 220 » On the Complexity of Computing Evolutionary Trees |
122
click to vote
TCS
2008
15 years 4 months ago
2008
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
135
click to vote
CIE
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
131
Voted
IPTPS
2005
Springer
15 years 9 months ago
2005
Springer
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
132
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
AbstractInteractive evolutionary algorithms (IEA) often suffer from what is called the “user bottleneck.” In this paper, we propose and analyse a method to limit the user inter...
120
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...