Sciweavers

387 search results - page 69 / 78
» Many Random Walks Are Faster Than One
Sort
View
SIGMOD
2008
ACM
190views Database» more  SIGMOD 2008»
14 years 9 months ago
OLTP through the looking glass, and what we found there
Online Transaction Processing (OLTP) databases include a suite of features -- disk-resident B-trees and heap files, locking-based concurrency control, support for multi-threading ...
Stavros Harizopoulos, Daniel J. Abadi, Samuel Madd...
ICC
2007
IEEE
127views Communications» more  ICC 2007»
14 years 3 months ago
Adaptive-Buffer Power Save Mechanism for Mobile Multimedia Streaming
— Wireless networks are becoming a part of everyday life for many people. When a mobile device has wireless LAN capability, multimedia content can be streamed over a wireless net...
Janet Adams
ATAL
2007
Springer
14 years 3 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 1 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
ESEC
1999
Springer
14 years 1 months ago
Yesterday, My Program Worked. Today, It Does Not. Why?
Imagine some program and a number of changes. If none of these changes is applied (“yesterday”), the program works. If all changes are applied (“today”), the program does n...
Andreas Zeller