Sciweavers

1370 search results - page 207 / 274
» Performance analysis and optimization of latency insensitive...
Sort
View
123
Voted
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
16 years 4 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
DSN
2007
IEEE
15 years 11 months ago
How to Choose a Timing Model?
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
ACSC
2004
IEEE
15 years 8 months ago
Learning Models for English Speech Recognition
This paper reports on an experiment to determine the optimal parameters for a speech recogniser that is part of a computer aided instruction system for assisting learners of Engli...
Huayang Xie, Peter Andreae, Mengjie Zhang, Paul Wa...
TPDS
2008
76views more  TPDS 2008»
15 years 4 months ago
How to Choose a Timing Model
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
PDCN
2004
15 years 6 months ago
Quality-of-service provisioning system for multimedia transmission in IEEE 802.11 wireless lans
IEEE 802.11, the standard of wireless local area networks (WLANs), allows the coexistence of asynchronous and time-bounded traffic using the distributed coordination function (DCF)...
Joseph Deng, Hsu-Chun Yen