Sciweavers

1120 search results - page 214 / 224
» time 1999
Sort
View
COLT
1999
Springer
15 years 2 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
ISIPTA
1999
IEEE
116views Mathematics» more  ISIPTA 1999»
15 years 2 months ago
On the Distribution of Natural Probability Functions
The purpose of this note is to describe the underlying insights and results obtained by the authors, and others, in a series of papers aimed at modelling the distribution of `natu...
Jeff B. Paris, Paul N. Watton, George M. Wilmers
ECOOP
1999
Springer
15 years 2 months ago
Visualizing Reference Patterns for Solving Memory Leaks in Java
Many Java programmers believe they do not have to worry about memory management because of automatic garbage collection. In fact, many Java programs run out of memory unexpectedly ...
Wim De Pauw, Gary Sevitsky
ECOOP
1999
Springer
15 years 2 months ago
Object-Oriented Programming on the Network
Object-oriented programming techniques have been used with great success for some time. But the techniques of object-oriented programming have been largely confined to the single a...
Jim Waldo
EDCC
1999
Springer
15 years 2 months ago
Considering Workload Input Variations in Error Coverage Estimation
The effects of variations in the workload input when estimating error detection coverage using fault injection are investigated. Results from scanchain implemented fault injection ...
Peter Folkesson, Johan Karlsson