23590 search results - page 627 / 4718 » Algorithm Performance Contest |
180
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
178
click to vote
IPSN
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we present a distributed, application-morphable, algorithm for waking up appropriate sensor nodes in a heterogeneous sensor network. We assume a sensor field consisti...
194
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
212
click to vote
COLT
1997
Springer
15 years 10 months ago
1997
Springer
: In this paper we prove sanity-check bounds for the error of the leave-one-out cross-validation estimate of the generalization error: that is, bounds showing that the worst-case e...
203
click to vote
ANCS
2008
ACM
15 years 8 months ago
2008
ACM
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...