2421 search results - page 170 / 485 » Approximate Flow-Aware Networking |
131
Voted
COLT
1993
Springer
15 years 7 months ago
1993
Springer
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...
119
click to vote
EOR
2007
15 years 3 months ago
2007
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
121
Voted
CJ
2010
15 years 3 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
107
click to vote
SIGMETRICS
2002
ACM
15 years 3 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
126
Voted
SIGMETRICS
2002
ACM
15 years 3 months ago
2002
ACM
Being able to model contention for software resources (e.g., a critical section or database lock) is paramount to building performance models that capture all aspects of the delay...