162 search results - page 19 / 33 » Study of Lower Bound Functions for MAX-2-SAT |
APIN
1998
14 years 11 months ago
1998
Incidence calculus is a probabilistic logic in which incidences, standing for the situations in which formulae may be true, are assigned to some formulae, and probabilities are as...
COCOON
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...
STOC
1991
ACM
15 years 3 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...