2210 search results - page 225 / 442 » CLEF 2001 - Overview of Results |
157
click to vote
WDAG
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
172
Voted
WER
2001
Springer
15 years 11 months ago
2001
Springer
Processes are certainly a key element in software management. Defining and using processes is believed to be an important factor towards quality. Our paper describes a general pro...
167
Voted
WER
2001
Springer
15 years 11 months ago
2001
Springer
A survey of different types of prototypes and current prototyping methods is presented. Especially the usage of prototypes with use cases and scenarios is investigated, and an appr...
153
Voted
WG
2001
Springer
15 years 11 months ago
2001
Springer
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
167
click to vote
WIA
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...