255 search results - page 18 / 51 » A new upper bound for the bipartite Ramsey problem |
223
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
170
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
163
click to vote
MOR
2010
15 years 4 months ago
2010
In this paper we study the problem of bounding the value of the probability distribution function of a random variable X at E[X] + a where a is a small quantity in comparison with...
157
click to vote
AAAI
1997
15 years 7 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
176
click to vote
VTC
2008
IEEE
16 years 14 days ago
2008
IEEE
Abstract— Diversity can play an important role in the performance improvement of a communication system in fading channels. The achievable performance with signal space diversity...