Sciweavers

1672 search results - page 247 / 335
» Tightness problems in the plane
Sort
View
WDAG
1994
Springer
104views Algorithms» more  WDAG 1994»
15 years 3 months ago
Fast Increment Registers
We give an optimal, wait-free implementation of an increment register. An increment register is a concurrent object consisting of an integer-valued register with an increment oper...
Soma Chaudhuri, Mark R. Tuttle
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 3 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
KDD
2010
ACM
282views Data Mining» more  KDD 2010»
15 years 2 months ago
Optimizing debt collections using constrained reinforcement learning
In this paper, we propose and develop a novel approach to the problem of optimally managing the tax, and more generally debt, collections processes at financial institutions. Our...
Naoki Abe, Prem Melville, Cezar Pendus, Chandan K....
127
Voted
PODC
2010
ACM
15 years 2 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
90
Voted
DAC
2009
ACM
15 years 2 months ago
Reduction techniques for synchronous dataflow graphs
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
Marc Geilen