The SCEAS System
Navigation Menu

Journals in DBLP

Soft Comput.
2003, volume: 7, number: 5

  1. Radim Jirousek, Gernot D. Kleiter, Jirina Vejnarová
    Editorial note. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2003, v:7, n:5, pp:279- [Journal]
  2. Andrea Capotorti, L. Galli, Barbara Vantaggi
    Locally strong coherence and inference with lower-upper probabilities. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2003, v:7, n:5, pp:280-287 [Journal]
  3. Milan Daniel
    Associativity in combination of belief functions; a derivation of minC combination. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2003, v:7, n:5, pp:288-296 [Journal]
  4. Jozef Gemela
    Learning Bayesian networks using various datasources and applications to financial analysis. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2003, v:7, n:5, pp:297-303 [Journal]
  5. Leen Gilbert, Gert De Cooman, Etienne E. Kerre
    Practical implementation of possibilistic probability mass functions. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2003, v:7, n:5, pp:304-309 [Journal]
  6. Angelo Gilio, Veronica Biazzo, Giuseppe Sanfilippo
    Coherence checking and propagation of lower probability bounds. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2003, v:7, n:5, pp:310-320 [Journal]
  7. Martin Janzura
    On the exponential representation problem. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2003, v:7, n:5, pp:321-327 [Journal]
  8. Radim Jirousek, Jirina Vejnarová
    Construction of multidimensional models by operators of composition: current state of art. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2003, v:7, n:5, pp:328-335 [Journal]
  9. Otakar Kríz
    Envelopes of a simplex of discrete probabilities. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2003, v:7, n:5, pp:336-343 [Journal]
  10. Azaria Paz
    An alternative version of Lauritzen et al.'s algorithm for checking representation of independencies. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2003, v:7, n:5, pp:344-349 [Journal]
  11. Bertran Steinsky
    Efficient coding of labeled directed acyclic graphs. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2003, v:7, n:5, pp:350-356 [Journal]
  12. Marta Vomlelová, Jirí Vomlel
    Troubleshooting: NP-hardness and solution methods. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2003, v:7, n:5, pp:357-368 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002