903 search results - page 43 / 181 » Non-well-founded trees in categories |
DAGSTUHL
2004
15 years 1 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
GECCO
2008
Springer
15 years 27 days ago
2008
Springer
Recently, a number of works have been done on how to use Genetic Algorithms to solve the Portfolio Optimization problem, which is an instance of the Resource Allocation problem cl...
GECCO
2008
Springer
15 years 27 days ago
2008
Springer
We introduce potential fitness, a variant of fitness function that operates in the space of schemata and is applicable to tree-based genetic programing. The proposed evaluation ...
SIGCOMM
2010
ACM
15 years 18 hour ago
2010
ACM
IP traceback can be used to find the origin of anonymous traffic; however, Internet-scale IP traceback systems have not been deployed due to a need for cooperation between Interne...