1099 search results - page 81 / 220 » On the Complexity of Computing Evolutionary Trees |
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
138
click to vote
HICSS
2003
IEEE
15 years 3 months ago
2003
IEEE
From the 1990s on, one of the most important challenges facing computer science researchers has been the design and construction of software tools to exploit Internet computing. A...
ICANNGA
2007
Springer
15 years 1 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
CEC
2007
IEEE
14 years 10 months ago
2007
IEEE
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
EUSFLAT
2001
14 years 11 months ago
2001
Standard financial techniques neglect extreme situations and regards large market shifts as too unlikely to matter. Such approach accounts for what occurs most of the time in the ...