Feel free to cite it and let me know so I can have a look ðŸ™‚

]]>Hi, sure! Feel free to cite it and let me know so I can have a look ðŸ™‚

]]>I hope you do not mind me accessing this in my article – I will properly cite you.

Best,

Namrata

@Simon:

Hi,

I hope you do not mind me accessing this in my journal article’s appendix – I will properly cite you.

Best,

Namrata

I cannot figure out why it only provides one result when there are many solutions:

def get_subsets(fullset):

listrep = list(fullset)

subsets = []

for i in range(2**len(listrep)):

subset = []

for k in range(len(listrep)):

if i & 1<<k:

subset.append(listrep[k])

subsets.append(subset)

return subsets

subsets = get_subsets(set([98.31,27.46,8869.56,522.4,4150.1,540.4,30.42,6067.79,98.31,269.2,3463.84,720.93,2978.08,107.36,117.08,107.36,229.77,1444.9,118.66,101.14,1264.58,89.44,429.99,530.14,113.57]))

SumTuples = map(sum,subsets)

list_a = list(subsets)

list_b = list(SumTuples)

Result = list(zip(list_a, list_b))

[t for t in Result if t[1] == 21158.62]

]]>I am just using torch.save (PyTorch) and then log_artifact. This works for me, not sure if there is a better solution.

]]>Another important thing to remember about this is that the left shift (<<) takes precedence over the arithmetic and (&), because the left shift is prioritized as exponentiation (see Simon's remark about 1 << k being equivalent to 2 ** k) and arithmetic and is bit-wise multiplication.

]]>The first element in each list are always the parent and all following elements are the child nodes.

]]>