11160 search results - page 237 / 2232 » Incompleteness in a General Setting |
149
Voted
STACS
2007
Springer
15 years 12 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
162
click to vote
COORDINATION
2004
Springer
15 years 11 months ago
2004
Springer
A development environment for applications specified in an extended version of a previously developed coordination model based on associatively broadcast interactions is presented....
174
click to vote
KR
2010
Springer
15 years 10 months ago
2010
Springer
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
137
Voted
DGCI
2000
Springer
15 years 10 months ago
2000
Springer
A generalization of a classical discrete tomography problem is considered: Reconstruct binary matrices from their absorbed row and columns sums, i.e., when some known absorption is...
162
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...