1099 search results - page 184 / 220 » On the Complexity of Computing Evolutionary Trees |
102
click to vote
IEEESCC
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
Recent advances in genotyping technology have led to the generation of an enormous quantity of genetic data. Traditional methods of statistical analysis have proved insufficient i...
CEC
2011
IEEE
13 years 9 months ago
2011
IEEE
—Games provide an ideal test bed for computational intelligence and significant progress has been made in recent years, most notably in games such as GO, where the level of play...
ALGORITHMICA
2004
14 years 9 months ago
2004
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...