4377 search results - page 477 / 876 » Mass problems and randomness |
199
click to vote
STOC
1992
ACM
15 years 11 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
170
click to vote
AUSAI
2009
Springer
15 years 11 months ago
2009
Springer
Ensembles are often capable of greater prediction accuracy than any of their individual members. As a consequence of the diversity between individual base-learners, an ensemble wil...
180
click to vote
ECOOP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
198
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
179
click to vote
AAAI
2007
15 years 9 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...