14386 search results - page 316 / 2878 » The Chinese Generals Problem |
147
click to vote
SETA
2004
Springer
15 years 10 months ago
2004
Springer
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
144
Voted
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
146
click to vote
SPAA
2010
ACM
15 years 10 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
142
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
142
Voted
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...