82 search results - page 2 / 17 » A Lower Bound on Wait-Free Counting |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...
GD
2009
Springer
13 years 2 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
AAAI
1996
13 years 6 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...