426 search results - page 16 / 86 » Possibilistic Stable Model Computing |
ACMSE
2010
ACM
13 years 5 months ago
2010
ACM
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
ASP
2001
Springer
14 years 5 days ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
MICCAI
2005
Springer
14 years 8 months ago
2005
Springer
In this study we address the problem of extracting a robust connectivity metric for brain white matter. We defined the connectivity problem as an energy minimization task, by assoc...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper we present Poisson sum series representations for α-stable (αS) random variables and α-stable processes, in particular concentrating on continuous-time autoregres...