Sciweavers

803 search results - page 21 / 161
» Independence in Direct-Product Graphs
Sort
View
JETAI
1998
110views more  JETAI 1998»
13 years 7 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
JCT
2008
76views more  JCT 2008»
13 years 7 months ago
Quadruple systems with independent neighborhoods
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
Zoltán Füredi, Dhruv Mubayi, Oleg Pikh...
CPC
2006
116views more  CPC 2006»
13 years 7 months ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
ICCS
1993
Springer
13 years 11 months ago
Towards Domain-Independent Machine Intelligence
Adaptive predictive search (APS), is a learning system framework, which given little initial domain knowledge, increases its decision-making abilities in complex problems domains....
Robert Levinson