4377 search results - page 193 / 876 » Mass problems and randomness |
159
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
181
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this paper we give conditions that a discrete time switched linear systems must satisfy if it is stable. We do this by calculating the mean and covariance of the set of matr...
172
click to vote
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper presents a simple continuous analog hardware realization of the Random Neural Network (RNN) model. The proposed circuit uses the general principles resulting from the u...
165
click to vote
ICPP
1998
IEEE
15 years 10 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
170
click to vote
COCO
1991
Springer
15 years 10 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...