47 search results - page 2 / 10 » Worst-Case Complexity of the Optimal LLL Algorithm |
GLOBECOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
DAGSTUHL
2004
13 years 7 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...
STACS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
COCOA
2010
Springer
13 years 3 months ago
2010
Springer
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
IJCAI
2001
13 years 7 months ago
2001
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...