109 search results - page 21 / 22 » Algorithm Selection as a Bandit Problem with Unbounded Losse... |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the tra...
SIGCOMM
2005
ACM
13 years 10 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
ICCAD
2000
IEEE
13 years 8 months ago
2000
IEEE
ct Static timing analysis has traditionally used the PERT method for identifying the critical path of a digital circuit. Due to the influence of the slope of a signal at a particul...
ICC
2009
IEEE
13 years 2 months ago
2009
IEEE
Abstract--We present experimental results for the performance of selected voice codecs using the Datagram Congestion Control Protocol (DCCP) with TCP-Friendly Rate Control (TFRC) c...
COMCOM
1998
13 years 4 months ago
1998
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...