818 search results - page 47 / 164 » Network bargaining: algorithms and structural results |
JMLR
2002
13 years 7 months ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
PKDD
2000
Springer
13 years 11 months ago
2000
Springer
Previous algoritms for the construction of belief networks structures from data are mainly based either on independence criteria or on scoring metrics. The aim of this paper is to ...
RECOMB
2008
Springer
14 years 8 months ago
2008
Springer
Comparative analysis of protein networks has proven to be a powerful approach for elucidating network structure and predicting protein function and interaction. A fundamental chall...
CCE
2006
13 years 8 months ago
2006
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...