4037 search results - page 110 / 808 » Routing without ordering |
DASFAA
2005
IEEE
14 years 2 months ago
2005
IEEE
A number of labeling schemes have been designed to facilitate the query of XML, based on which the ancestor-descendant relationship between any two nodes can be determined quickly....
HIPC
2005
Springer
14 years 2 months ago
2005
Springer
We recently proposed a new approach to parallelization, by decomposing the time domain, instead of the conventional space domain. This improves latency tolerance, and we demonstrat...
AUSAI
2003
Springer
14 years 2 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
EUROPAR
2000
Springer
14 years 22 days ago
2000
Springer
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...
OPODIS
2008
13 years 10 months ago
2008
It has been widely suggested that memory transactions should behave as if they acquired and released a single global lock. Unfortunately, this behavior can be expensive to achieve...