36781 search results - page 287 / 7357 » Parameterizing by the Number of Numbers |
162
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Of the common commutative binary logical connectives, only and and or may be used as operators that take arbitrary numbers of arguments with order and multiplicity being irrelevan...
147
click to vote
FSTTCS
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. This paper presents the first formal verification of the RicartAgrawala algorithm [RA81] for distributed mutual exclusion of an arbitrary number of nodes. It uses the Tem...
167
click to vote
MST
2007
15 years 5 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
186
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
177
click to vote
TCS
2010
15 years 4 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...