Sciweavers

995 search results - page 1 / 199
» Wire-speed total order
Sort
View
SIAMNUM
2010
120views more  SIAMNUM 2010»
13 years 5 months ago
A Genuinely High Order Total Variation Diminishing Scheme for One-Dimensional Scalar Conservation Laws
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...
Xiangxiong Zhang, Chi-Wang Shu
SAC
2006
ACM
13 years 10 months ago
From spontaneous total order to uniform total order: different degrees of optimistic delivery
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...
Luís Rodrigues, José Mocito, Nuno Ca...
ANCS
2008
ACM
14 years 28 days ago
Low power architecture for high speed packet classification
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...
Alan Kennedy, Xiaojun Wang, Zhen Liu, Bin Liu
AAAI
1993
14 years 7 days ago
Relative Utility of EBG based Plan Reuse in Partial Ordering vs. Total Ordering Planning
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...
Subbarao Kambhampati, Jengchin Chen
IJCAI
2001
14 years 9 days ago
Total-Order Planning with Partially Ordered Subtasks
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...
Dana S. Nau, Héctor Muñoz-Avila, Yue...