2899 search results - page 360 / 580 » Dynamic Trees in Practice |
109
click to vote
CCGRID
2009
IEEE
15 years 7 months ago
2009
IEEE
— Unpredictable access to batch-mode HPC resources is a significant problem for emerging dynamic data-driven applications. Although efforts such as reservation or queue-time pred...
105
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
BIBE
2007
IEEE
15 years 7 months ago
2007
IEEE
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
75
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
— In this paper we present a novel cost benefit operator that assists multi level genetic algorithm searches. Through the use of the cost benefit operator, it is possible to dyna...
63
Voted
HICSS
2007
IEEE
15 years 7 months ago
2007
IEEE
Dynamic community crisis response teams form quickly at the onset of a crisis providing assistance until external specialty resources arrive. FEMA recommends individual preparedne...