8 search results - page 2 / 2 » A Uniform Lower Bound on Weights of Perceptrons |
ESA
2004
Springer
13 years 10 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...