3991 search results - page 329 / 799 » Bounding homogeneous models |
166
click to vote
WDAG
2001
Springer
15 years 11 months ago
2001
Springer
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
178
click to vote
PODC
1999
ACM
15 years 11 months ago
1999
ACM
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
139
Voted
MCU
2007
15 years 8 months ago
2007
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
165
Voted
CCR
2010
15 years 7 months ago
2010
We provide a detailed analysis of the Lossy Difference Aggregator, a recently developed data structure for measuring latency in a router environment where packet losses can occur....
143
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Identifying codes have been introduced in 1998 to model fault-detection in multiprocessor systems. In this paper, we introduce two variations of identifying codes: weak codes and ...