5284 search results - page 681 / 1057 » Sampling search-engine results |
164
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider two new formulations for classification problems in the spirit of support vector machines based on robust optimization. Our formulations are designed to build in prote...
178
click to vote
CN
2006
15 years 6 months ago
2006
This paper uses trace-driven simulation to study the unfairness properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Processing Ti...
186
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Results of neural network learning are always subject to some variability, due to the sensitivity to initial conditions, to convergence to local minima, and, sometimes more dramat...
208
click to vote
SYNTHESE
2008
2008
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
15 years 6 months ago
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
155
click to vote
IJSN
2007
15 years 6 months ago
2007
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...