142 search results - page 19 / 29 » Approximation and limiting behavior of random models |
WWW
2008
ACM
14 years 9 months ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
AAAI
2011
12 years 8 months ago
2011
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
QUESTA
2006
13 years 8 months ago
2006
In this paper we consider a Poisson cluster process N as a generating process for the arrivals of packets to a server. This process generalizes in a more realistic way the infinite...
INFOCOM
2000
IEEE
14 years 24 days ago
2000
IEEE
— In this paper we demonstrate how TCP congestion control can show chaotic behavior. We demonstrate the major features of chaotic systems in TCP/IP networks with examples. These ...
AAAI
2007
13 years 10 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...