151 search results - page 30 / 31 » Teaching Relational Optimizers About XML Processing |
OPODIS
2010
13 years 5 months ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
ICDCN
2009
Springer
14 years 2 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
MP
2002
13 years 7 months ago
2002
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...