548 search results - page 88 / 110 » Parallel Relative Debugging with Dynamic Data Structures |
135
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
159
Voted
RTA
1995
Springer
15 years 7 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
117
Voted
IV
2009
IEEE
15 years 10 months ago
2009
IEEE
Visualisation and structuring of tasks in a schedule, from relatively simple activities such as meeting scheduling to more complex ones such as project planning, has been traditio...
110
Voted
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper examines the dynamics of a networked multi-agent system operating with a consensus-type coordination algorithm that can be influenced by external agents. We refer to thi...
157
click to vote
CF
2006
ACM
15 years 9 months ago
2006
ACM
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...