Sciweavers

9316 search results - page 1559 / 1864
» Analysis of traceback techniques
Sort
View
ICSE
2000
IEEE-ACM
15 years 10 months ago
A case study of open source software development: the Apache server
According to its proponents, open source style software development has the capacity to compete successfully, and perhaps in many cases displace, traditional commercial developmen...
Audris Mockus, Roy T. Fielding, James D. Herbsleb
NGC
2000
Springer
115views Communications» more  NGC 2000»
15 years 10 months ago
Hierarchical reliable multicast
The use of proxies for local error recovery and congestion control is a scalable technique used to overcome a number of wellknown problems in Reliable Multicast (RM). The idea is ...
Athina Markopoulou, Fouad A. Tobagi
SSPR
2000
Springer
15 years 10 months ago
The Role of Combining Rules in Bagging and Boosting
To improve weak classifiers bagging and boosting could be used. These techniques are based on combining classifiers. Usually, a simple majority vote or a weighted majority vote are...
Marina Skurichina, Robert P. W. Duin
FOCS
1995
IEEE
15 years 10 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
FPCA
1995
15 years 10 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
« Prev « First page 1559 / 1864 Last » Next »