5 search results - page 1 / 1 » Knowing Minimum Maximum n Formulae |
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We introduce a logical language with nullary operators min(n), for each non-negative integer n, which mean `the reasoner has at least n different beliefs'. The resul...
100
Voted
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MOBICOM
2009
ACM
15 years 4 months ago
2009
ACM
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...