Search results

23 packages found

Knapsack Pro Core library splits tests across CI nodes and makes sure that tests will run in optimal time on each CI node. This library gives core features like communication with KnapsackPro.com API. This library is a dependency for other projects specif

published 7.1.0 4 months ago
M
Q
P

Knapsack Pro Cypress splits Cypress.io tests across CI nodes and makes sure that tests will run in optimal time on each CI node.

published 8.1.0 4 months ago
M
Q
P

Knapsack Pro Jest splits Jest tests across CI nodes and makes sure that tests will run in optimal time on each CI node.

published 8.1.0 4 months ago
M
Q
P

Build Design Systems with Knapsack

published 4.69.11 a day ago
M
Q
P
M
Q
P

Rectpack-ts is a TypeScript library that implements heuristic algorithms for solving the 2D knapsack problem, also known as the bin packing problem. This involves packing a set of rectangles into the smallest number of bins.

published 0.0.1 2 months ago
M
Q
P

A Node-RED node that load balances electric consumption based on the knapsack algorithm.

published 1.0.0 a year ago
M
Q
P

Automatically provisions and installs locally-trusted TLS certificates for Node.js https servers (including Express.js, etc.) using mkcert.

published 4.69.11 a day ago
M
Q
P

Get CI environment variables for parallelizing builds

published 1.0.1 4 years ago
M
Q
P

A module for resource allocation solving

published 1.0.2 8 years ago
M
Q
P
M
Q
P

(Bounded) Knapsack problem

published 2.0.0 8 years ago
M
Q
P
published 3.38.4 3 years ago
M
Q
P

A handy bag of sass utilities and mixins

published 1.1.0 8 years ago
M
Q
P

bin-packing algorithms

published 1.7.0 3 years ago
M
Q
P

A Node-RED node that demonstrates the use of the Knapsack algorithm

published 1.0.0 a year ago
M
Q
P

Decoder, Encoder and Cracker for Merkle–Hellman knapsack cryptosystem

published 2.0.0 5 years ago
M
Q
P

Knapsack problem algorithms for JavaScript

published 0.0.1 3 years ago
M
Q
P

Solve the unbounded knapsack problem and its dual version

published 0.1.2 2 years ago
M
Q
P

Solves a variation of knapsack problem. Target is to fulfill `capacity` using values from the `values` array while minimizing overflow over `capacity`.

published 1.0.0 2 years ago
M
Q
P