9997 search results - page 372 / 2000 » The case for crowd computing |
244
click to vote
LADC
2011
Springer
14 years 9 months ago
2011
Springer
—We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We sho...
184
click to vote
EUROSSC
2006
Springer
15 years 10 months ago
2006
Springer
We consider the challenge of dynamically adapting services to context changes that occur in ubiquitous computing environments (e.g., changes in a user's activity) and propose ...
172
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
144
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
We explore the Full Compressed Delta Encoding problem in compressed texts, defined as the problem of constructing a delta file directly from the two given compressed files, withou...
144
Voted
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
Joseph Yucas and Gary Mullen conjectured that there is no self-reciprocal irreducible pentanomial of degree n over F2 if n is divisible by 6. In this note we prove this conjecture ...