4007 search results - page 240 / 802 » Computation with imprecise probabilities |
128
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
108
click to vote
WOLLIC
2009
Springer
15 years 11 months ago
2009
Springer
After briefly mentioning the historical background of PLL/SRL, we examine PRISM, a logic-based modeling language, as an instance of PLL/SRL research. We first look at the distrib...
126
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
130
click to vote
ICNC
2005
Springer
15 years 10 months ago
2005
Springer
This paper incorporates robustness into neural network modeling and proposes a novel two-phase robustness analysis approach for determining the optimal feedforward neural network (...
116
click to vote
DFT
2004
IEEE
15 years 8 months ago
2004
IEEE
We present a model for computing the probability of a parametric failure due to a spot defect. The analysis is based on electromigration in conductors under unidirectional current...