2976 search results - page 94 / 596 » On the bounded integer programming |
95
Voted
ISCA
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper examines the performance of desktop applications running on the Microsoft Windows NT operating system on Intel x86 processors, and contrasts these applications to the p...
119
click to vote
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
85
Voted
TPDS
1998
15 years 5 days ago
1998
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
113
Voted
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...
108
Voted
CORR
2010
Springer
15 years 19 days ago
2010
Springer
Let S = {si}iIN IN be a numerical semigroup. For si S, let (si) denote the number of pairs (si -sj, sj) S2 . When S is the Weierstrass semigroup of a family {Ci}iIN of one-point...