2976 search results - page 251 / 596 » On the bounded integer programming |
135
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...
134
Voted
ISSAC
2004
Springer
15 years 10 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
116
click to vote
ISMVL
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract—Let A and B be integers such that A ≤ B. An nvariable interval function is a mapping IN[n : A, B] : {0, 1}n → {0, 1}, where IN[n : A, B](X) = 1 iff A ≤ X ≤ B. Su...
164
click to vote
CSR
2010
Springer
15 years 10 months ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
137
click to vote
ANTS
1994
Springer
15 years 9 months ago
1994
Springer
We propose a fast variant of the Gaussian algorithm for the reduction of two{ dimensional lattices for the l1; l2; and l1;norm. The algorithm runs in at most O(n M(B) logB) bit op...