1458 search results - page 128 / 292 » Monads for incremental computing |
171
click to vote
ACMSE
2010
ACM
15 years 4 months ago
2010
ACM
Reinforcement Programming (RP) is a new technique for automatically generating a computer program using reinforcement learning methods. This paper describes how RP learned to gene...
294
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
181
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
208
click to vote
PODS
2012
ACM
13 years 8 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
189
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
— Location-based services (LBS) have been widely accepted by mobile users. Many LBS users have direction-aware search requirement that answers must be in a search direction. Howe...