1275 search results - page 74 / 255 » time 1998 |
IPL
1998
13 years 10 months ago
1998
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
ORL
1998
13 years 10 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
PAAPP
1998
13 years 10 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
QUESTA
1998
13 years 10 months ago
1998
We consider optimal policies for reentrant queues in which customers may be served several times at the same station. We show that for tandem reentrant queues the lastbuffer-fir...
TNN
1998
13 years 10 months ago
1998
—Oja’s principal subspace algorithm is a well-known and powerful technique for learning and tracking principal information in time series. A thorough investigation of the conve...