4377 search results - page 660 / 876 » Mass problems and randomness |
210
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
220
click to vote
TJS
2002
15 years 6 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
294
click to vote
WINET
2002
15 years 6 months ago
2002
Abstract. TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless netwo...
200
click to vote
ML
2007
ACM
15 years 6 months ago
2007
ACM
Which active learning methods can we expect to yield good performance in learning binary and multi-category logistic regression classifiers? Addressing this question is a natural ...
156
click to vote
SIAMCO
2010
15 years 5 months ago
2010
In this paper we introduce a dynamic vehicle routing problem in which there are multiple vehicles and multiple priority classes of service demands. Service demands of each priority...