4930 search results - page 780 / 986 » Learning minimal abstractions |
167
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
150
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
172
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
164
click to vote
DAM
2008
15 years 6 months ago
2008
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
145
click to vote
EJC
2010
15 years 6 months ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...