995 search results - page 1 / 199 » Wire-speed total order |
SIAMNUM
2010
12 years 11 months ago
2010
It is well known that finite difference or finite volume total variation diminishing (TVD) schemes solving one-dimensional scalar conservation laws degenerate to first order accura...
SAC
2006
ACM
13 years 4 months ago
2006
ACM
A total order protocol is a fundamental building block in the construction of distributed fault-tolerant applications. Unfortunately, the implementation of such a primitive can be...
ANCS
2008
ACM
13 years 7 months ago
2008
ACM
Today's routers need to perform packet classification at wire speed in order to provide critical services such as traffic billing, priority routing and blocking unwanted Inte...
AAAI
1993
13 years 6 months ago
1993
This paper provides a systematic analysisof the relativeutility of basingEBG based plan reuse techniques in partial ordering vs. total ordering planning frameworks. We separate th...
IJCAI
2001
13 years 6 months ago
2001
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...