36 search results - page 4 / 8 » Worst-Case Analysis of the Perceptron and Exponentiated Upda... |
STACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
LCN
1994
IEEE
13 years 11 months ago
1994
IEEE
We analyze the behavior of the Ethernet in networks with a small number of active stations, and describe what is known as the Ethernet capture effect, where a station transmits co...
COLT
2007
Springer
14 years 1 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
ICCCN
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...
HYBRID
1994
Springer
13 years 11 months ago
1994
Springer
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...