5922 search results - page 907 / 1185 » Navigability of Complex Networks |
189
click to vote
UAI
2008
15 years 8 months ago
2008
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
219
click to vote
UAI
2008
15 years 8 months ago
2008
Gaussian Markov random fields (GMRFs) are useful in a broad range of applications. In this paper we tackle the problem of learning a sparse GMRF in a high-dimensional space. Our a...
221
click to vote
UAI
2008
15 years 8 months ago
2008
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...
204
click to vote
WICON
2008
15 years 8 months ago
2008
Demand-driven spectrum allocation can drastically improve performance for WiFi access points struggling under increasing user demands. While their frequency agility makes cognitive...
212
click to vote
AAAI
2006
15 years 8 months ago
2006
Intelligent agents must be able to handle the complexity and uncertainty of the real world. Logical AI has focused mainly on the former, and statistical AI on the latter. Markov l...