207 search results - page 26 / 42 » Run-Time Switching Between Total Order Algorithms |
SODA
2004
ACM
13 years 8 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
ICDT
2001
ACM
13 years 12 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custome...
IPPS
2003
IEEE
14 years 21 days ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—In distributed detection systems with wireless sensor networks, the communication between sensors and a fusion center is not perfect due to interference and limited transmitter ...