78 search results - page 4 / 16 » Computable Obstructions to Wait-free Computability |
ICDCS
2003
IEEE
14 years 2 months ago
2003
IEEE
We introduce obstruction-freedom, a new nonblocking property for shared data structure implementations. This property is strong enough to avoid the problems associated with locks,...
COMBINATORICS
2007
13 years 9 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
WADS
2007
Springer
14 years 3 months ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
JSC
2006
13 years 9 months ago
2006
We describe explicit methods of exhibiting elements of the Brauer groups of diagonal quartic surfaces. Using these methods, we compute the algebraic Brauer