224 search results - page 14 / 45 » G-graphs for the cage problem: a new upper bound |
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, ...
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 ...
241
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
176
click to vote
VTC
2008
IEEE
16 years 13 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...
171
click to vote
STOC
1995
ACM
15 years 9 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...