6939 search results - page 675 / 1388 » Algorithm Engineering for Parallel Computation |
174
click to vote
SPAA
2003
ACM
16 years 9 days ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
232
click to vote
CSIE
2009
IEEE
15 years 11 months ago
2009
IEEE
K-means algorithm is one of the most famous unsupervised clustering algorithms. Many theoretical improvements for the performance of original algorithms have been put forward, whi...
215
click to vote
EUROPAR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
203
click to vote
CONCUR
2006
Springer
15 years 9 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
185
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...