548 search results - page 88 / 110 » Parallel Relative Debugging with Dynamic Data Structures |
116
Voted
KDD
2007
ACM
16 years 2 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...
141
click to vote
RTA
1995
Springer
15 years 5 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 ...
102
click to vote
IV
2009
IEEE
15 years 8 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...
CDC
2010
IEEE
14 years 9 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...
136
click to vote
CF
2006
ACM
15 years 8 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, ...