Sciweavers

4880 search results - page 781 / 976
» Mechanism Design by Creditability
Sort
View
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 6 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline
WISES
2003
15 years 6 months ago
Intelligent UART Module for Real-Time Applications
— More and more fieldbus applications require a communication with real-time properties, while still being economically feasible. The fieldbuses LIN and TTP/A take this require...
Martin Delvai, Ulrike Eisenmann, Wilfried Elmenrei...
FTCS
1998
91views more  FTCS 1998»
15 years 6 months ago
How Fail-Stop are Faulty Programs?
Most fault-tolerant systems are designed to stop faulty programs before they write permanent data or communicate with other processes. This property (halt-on-failure) forms the co...
Subhachandra Chandra, Peter M. Chen
FLAIRS
2000
15 years 6 months ago
Fundamental Properties of the Core Matching Functions for Information Retrieval
Traditional benchmarking methods for information retrieval (IR) are based on experimental performance evaluation. Although the metrics precision and recall can measure the perform...
Dawei Song, Kam-Fai Wong, Peter Bruza, Chun Hung C...
FORTE
2000
15 years 6 months ago
Systematic Performance Evaluation of Multipoint Protocols
The adventof multipoint(multicast-based) applications and the growth and complexity of the Internet has complicated network protocol design and evaluation. In this paper, we prese...
Ahmed Helmy, Sandeep K. S. Gupta, Deborah Estrin, ...