539 search results - page 32 / 108 » An Improved Upper Bound for SAT |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...
CCCG
2009
13 years 8 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
WIOPT
2011
IEEE
12 years 11 months ago
2011
IEEE
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...