1382 search results - page 256 / 277 » Formal Analysis of Online Algorithms |
101
click to vote
ATAL
2010
Springer
15 years 25 days ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
IJFCS
2006
14 years 11 months ago
2006
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...
175
click to vote
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
Transactional workloads are a hallmark of modern OLTP and Web applications, ranging from electronic commerce and banking to online shopping. Often, the database at the core of the...
WWW
2006
ACM
16 years 11 days ago
2006
ACM
The currently booming search engine industry has determined many online organizations to attempt to artificially increase their ranking in order to attract more visitors to their ...