Sciweavers

4037 search results - page 126 / 808
» Routing without ordering
Sort
View
MOR
2008
169views more  MOR 2008»
13 years 9 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
HPCA
2009
IEEE
14 years 9 months ago
In-Network Snoop Ordering (INSO): Snoopy coherence on unordered interconnects
Realizing scalable cache coherence in the many-core era comes with a whole new set of constraints and opportunities. It is widely believed that multi-hop, unordered on-chip networ...
Niket Agarwal, Li-Shiuan Peh, Niraj K. Jha
OSDI
2004
ACM
14 years 9 months ago
Improving the Reliability of Internet Paths with One-hop Source Routing
Recent work has focused on increasing availability in the face of Internet path failures. To date, proposed solutions have relied on complex routing and pathmonitoring schemes, tr...
P. Krishna Gummadi, Harsha V. Madhyastha, Steven D...
CSL
2009
Springer
14 years 1 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
14 years 9 months ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila