We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Genetic algorithms are heuristic search algorithm used in science, engineering and many other areas. They are powerful but slow because of their evolutionary nature that mimics th...
In order to facilitate query processing, the information contained in data warehouses is typically stored as a set of materialized views. Deciding which views to materialize prese...
Roozbeh Derakhshan, Frank K. H. A. Dehne, Othmar K...
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...