Sciweavers

5580 search results - page 20 / 1116
» Randomized priority algorithms
Sort
View
DAGSTUHL
2004
13 years 9 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
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...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
SODA
2001
ACM
90views Algorithms» more  SODA 2001»
13 years 9 months ago
Internet packet filter management and rectangle geometry
We consider rule sets for internet packet routing and filtering, where each rule consists of a range of source addresses, a range of destination addresses, a priority, and an acti...
David Eppstein, S. Muthukrishnan
CAISE
2003
Springer
14 years 29 days ago
Improving Termination Analysis of Active Rules with Priorities
This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have sugg...
Alain Couchot
IPL
2006
80views more  IPL 2006»
13 years 7 months ago
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority al...
Neal Lesh, Michael Mitzenmacher
GI
2009
Springer
13 years 5 months ago
A Generic Approach for Modeling Test Case Priorities with Applications for Test Development and Execution
: This contribution addresses systematic test development methods to include an algorithm to retrieve a test suite execution control in order to run test cases with high priority e...
Andreas Hoffmann, Axel Rennoch, Ina Schieferdecker...