in reply to Re^2: Proportional distribution of indivisible items
in thread Proportional distribution of indivisible items

> My latest idea taken from various replies and munged/improved, is to start by putting the biggest five each in their own child process (that first step is obviously right though difficult to prove) 

Probably because it's obviously wrong?

5+5+2 =12

3+3+3+3=12

> have each worker, on finishing a job, solve the remaining tree for what to take next

That's the best approach if you can avoid race conditions of two workers picking the same job.

> it does look like a partitioning problem but for reals not just integers.

All floats are effectively only integer approximations of real numbers. So?

> The best solution is indeed supposed to be something similar to a neural network,

By whom? Source?

Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery FootballPerl is like chess, only without the dice

  • Comment on Re^3: Proportional distribution of indivisible items

Replies are listed 'Best First'.
Re^4: Proportional distribution of indivisible items
by anonymized user 468275 (Curate) on Aug 16, 2018 at 11:48 UTC
    kabocha (except this feature is disabled). So I'll give you an exercise - see if you can find where your post contradicts itself.

    update: hint: it isn't in your example supersets, in spite of the fact that they are a non-example.

    One world, one people

[reply]
[reply]

        Don’t summon the evil spirits.

        «The Crux of the Biscuit is the Apostrophe»

        perl -MCrypt::CBC -E 'say Crypt::CBC->new(-key=>'kgb',-cipher=>"Blowfish")->decrypt_hex($ENV{KARL});'Help

[reply]
[d/l]

In Section Seekers of Perl Wisdom