Sciweavers

2286 search results - page 316 / 458
» Algorithms for Categorical Equivalence
Sort
View
APAL
2004
105views more  APAL 2004»
15 years 6 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
ACTA
2000
92views more  ACTA 2000»
15 years 6 months ago
How to Calculate Symmetries of Petri Nets
Symmetric net structure yields symmetric net behaviour. Thus, knowing the symmetries of a net, redundant calculations can be skipped. We present a framework for the calculation of ...
Karsten Schmidt 0004
AI
2000
Springer
15 years 6 months ago
Credal networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Evidence suggests that credal ...
Fabio Gagliardi Cozman
SIAMJO
2002
159views more  SIAMJO 2002»
15 years 6 months ago
Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...
Yun-Bin Zhao, Duan Li
IJAR
2010
113views more  IJAR 2010»
15 years 5 months ago
A geometric view on learning Bayesian network structures
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
Milan Studený, Jirí Vomlel, Raymond ...