Results 51 to 60 of about 43,488 (185)
Coefficients of Sylvester's Denumerant [PDF]
, 2013 For a given sequence $\mathbf{\alpha} = [\alpha_1,\alpha_2,\dots,\alpha_{N+1}]$ of $N+1$ positive integers, we consider the combinatorial function $E(\mathbf{\alpha})(t)$ that counts the nonnegative integer solutions of the equation $\alpha_1x_1+\alpha_2
Baldoni, Velleda +5 more
core +3 more sources
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures [PDF]
, 1994 A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems.
Abdul-Hamid, F, Mitra, G, Yarrow, L
core
Approximating Geometric Knapsack via L-packings
, 2017 We study the two-dimensional geometric knapsack problem (2DK) in which we are given a set of n axis-aligned rectangular items, each one with an associated profit, and an axis-aligned square knapsack.
Grandoni, Fabrizio +5 more
core +1 more source
Cosolver2B: An Efficient Local Search Heuristic for the Travelling Thief Problem
, 2016 Real-world problems are very difficult to optimize. However, many researchers have been solving benchmark problems that have been extensively investigated for the last decades even if they have very few direct applications.
Ahiod, Belaïd, Yafrani, Mohamed El
core +1 more source
Knapsack problems in groups [PDF]
Mathematics of Computation, 2014 28 pages, 12 ...
Myasnikov, Alexei +2 more
openaire +2 more sources
AN IDEA FOR KNAPSACK CRYPTOSYSTEM BACKDOOR
Безопасность информационных технологийThere are practically no known backdoors in a knapsack cryptosystem, the security of which is based on the difficulty of solving the knapsack packing problem.
Mikhail A. Ivanov
doaj +1 more source
A performance model of speculative prefetching in distributed information systems
, 1999 Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which has been largely ignored, that of performance modelling.
Kumar, M., Tuah, N. J., Venkatesh, S.
core +2 more sources
MaxHedge: Maximising a Maximum Online [PDF]
, 2019 We introduce a new online learning framework where, at each trial, the learner is required to select a subset of actions from a given known action set. Each action is associated with an energy value, a reward and a cost.
Chan, Kevin +4 more
core +2 more sources
Theoretical Computer Science, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lan, Yan +4 more
openaire +1 more source
Knapsack sprayers: effort required for pumping lever operation
Ciência Rural: Various equipment, mainly manual knapsack sprayers, are used to apply agrochemicals by smallholder farmers. They are highlighted by their versatility of use and mainly by their low cost for farmers.
Edson Lambrecht +4 more
doaj +1 more source