2681 search results - page 73 / 537 » Problem F |
TIT
1998
13 years 9 months ago
1998
Abstract— We consider the problem of one-step-ahead prediction of a real-valued, stationary, strongly mixing random process fXig
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
WDAG
1999
Springer
14 years 2 months ago
1999
Springer
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
IFIP
1994
Springer
14 years 2 months ago
1994
Springer
The aim of this discussion paper is to stimulate (or perhaps to provoke) stronger interactions among theoreticians and practitioners interested in efficient problem solutions. We ...