2612 search results - page 385 / 523 » Switching Graphs and Their Complexity |
NIPS
2000
14 years 11 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
COLING
1992
14 years 11 months ago
1992
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make li...
CIDR
2009
14 years 11 months ago
2009
Enterprise environments have isolated teams responsible separately for database management and the management of underlying networkattached server-storage infrastructure (referred...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
107
click to vote
AI
2010
Springer
14 years 10 months ago
2010
Springer
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...