205
Voted
AI
9 years 8 months ago
2016 Springer
In the Complete Set Partitioning problem we are given a finite set of elements where every subset is associated with a nd the goal is to partition this set into disjoint subsets ...
114
click to vote
AI
9 years 8 months ago
2016 Springer
We introduce the structural interface algorithm for exact probabilistic inference in dynamic Bayesian networks. It unifies state-of-the-art techniques for inference in static and...
207
click to vote
AI
9 years 8 months ago
2016 Springer
Designing high-performance algorithms for computationally hard problems is a difficult and often time-consuming task. In this work, we demonstrate that this task can be automated...
138
click to vote
AI
9 years 8 months ago
2016 Springer
The standard way of answering queries over incomplete databases is to compute certain answers, defined as the intersection of query answers on all complete databases that the inc...
117
Voted
AI
9 years 8 months ago
2016 Springer
We discuss a new implementation of, and new experiments with, Fajtlowicz’s Dalmatian conjecture-making heuristic. Our program makes conjectures about relations of real number in...
|