837 search results - page 2 / 168 » Hard combinators |
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
This paper addresses the problem of constructing voting protocols that are hard to manipulate. We describe a general technique for obtaining a new protocol by combining two or more...
TREC
2004
13 years 7 months ago
2004
York University participated in HARD and Genomics tracks this year. For both tracks, we used Okapi BSS (basic search system) as the basis. Our experiments mainly focused on exploi...
TREC
2004
13 years 7 months ago
2004
Institute of Software, Chinese Academy of Sciences (ISCAS) participated in TREC-2004, submitting 18 runs. We focus on studying the problem of the combination of the user- and quer...
ITA
2000
13 years 5 months ago
2000
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
IPPS
1997
IEEE
13 years 9 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...