In computer science, the fetch-and-add CPU instruction that atomically modifies the contents of a memory location. That is, fetch-and-add performsâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

Recent advances in Symbolic Dynamic Programming (SDP) combined with the extended algebraic decision diagram (XADD) have providedâ€¦Â (More)

Is this relevant?

2013

2013

Recent advances in symbolic dynamic programming (SDP) combined with the extended algebraic decision diagram (XADD) data structureâ€¦Â (More)

Is this relevant?

2013

2013

- Adam Morrison, Yehuda Afek
- PPOPP
- 2013

Conventional wisdom in designing concurrent data structures is to use the most powerful synchronization primitive, namely compareâ€¦Â (More)

Is this relevant?

2012

2012

- Scott Sanner, Ehsan Abbasnejad
- AAAI
- 2012

Probabilistic reasoning in the real-world often requires inference in continuous variable graphical models, yet there are fewâ€¦Â (More)

Is this relevant?

2012

2012

- Zahra Zamani, Scott Sanner, Cheng Fang
- AAAI
- 2012

Qa := âˆ« Qa âŠ— P (xj|b,b â€²,x, a,y) dxj [Symbolic Substitution] For all bi in Qa Qa := [ Qa âŠ— P (bi|b,x, a,y) ] |bâ€²i=1 âŠ• [ Qa âŠ— Pâ€¦Â (More)

Is this relevant?

2011

2011

In this thesis we design algorithms for three problems: snapshot, consensus, and fetch-and-add modulo k. Our solutions forâ€¦Â (More)

Is this relevant?

2011

2011

Many real-world decision-theoretic planning problems can be naturally modeled with discrete and continuous state Markov decisionâ€¦Â (More)

Is this relevant?

1991

1991

- Eric Freudenthal, Allan Gottlieb
- ASPLOS
- 1991

The fetch-and-add (F&A) operation has been used effectively in a number of pr-occss coordination algorithms. In dris paper weâ€¦Â (More)

Is this relevant?

1988

1988

- G. Jack Lipovski, Paul Vaughan
- ISCA
- 1988

An efficient fetch-and-op circuit is described. A bit-serial circuit-switched implementation requires only 5 gates per node in aâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Maurice Herlihy
- PODC
- 1988

A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in aâ€¦Â (More)

Is this relevant?