From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 10ad19,23963231b5359f74 X-Google-Attributes: gid10ad19,public X-Google-Thread: 1073c2,23963231b5359f74 X-Google-Attributes: gid1073c2,public X-Google-Thread: 101deb,23963231b5359f74 X-Google-Attributes: gid101deb,public X-Google-Thread: 107a89,23963231b5359f74 X-Google-Attributes: gid107a89,public X-Google-Thread: 103376,23963231b5359f74 X-Google-Attributes: gid103376,public X-Google-Thread: 10a146,23963231b5359f74 X-Google-Attributes: gid10a146,public X-Google-ArrivalTime: 2001-06-11 06:55:03 PST Path: archiver1.google.com!newsfeed.google.com!sn-xit-02!supernews.com!newsfeed.direct.ca!look.ca!dispose.news.demon.net!demon!easynet-monga!easynet.net!news1.ebone.net!news.ebone.net!news.net.uni-c.dk!uninett.no!news.ost.eltele.no!news2.oke.nextra.no!nextra.com!news3.oke.nextra.no.POSTED!not-for-mail Sender: Leif Roar Moldskred From: Leif Roar Moldskred Subject: Re: Off Topic: Stupid Bureaucrats (was Re: Long names are doom ?) Newsgroups: comp.lang.ada,comp.lang.awk,comp.lang.clarion,comp.lang.java.programmer,comp.lang.pl1,comp.lang.vrml References: <9f8b7b$h0e$1@nh.pace.co.uk> <9fgagu$6ae$1@nh.pace.co.uk> <9fjgha$blf$1@nh.pace.co.uk> <35mqhtkdfma2rggv1htcaq6vfn2ihs67a1@4ax.com> <9fli1b$4aa$1@nh.pace.co.uk> <9folnd$1t8$1@nh.pace.co.uk> <3B204C82.C2681D79@home.com> <9fqla6$n3o$1@nh.pace.co.uk> User-Agent: tin/1.4.4-20000803 ("Vet for the Insane") (UNIX) (Linux/2.2.17-21mdk (i686)) Message-ID: NNTP-Posting-Host: 195.18.231.130 X-Complaints-To: news-abuse@nextra.no NNTP-Posting-Date: Mon, 11 Jun 2001 15:54:26 MEST Organization: Nextra Public Access X-Trace: news3.oke.nextra.no 992267666 195.18.231.130 Date: Mon, 11 Jun 2001 13:54:26 GMT Xref: archiver1.google.com comp.lang.ada:8540 comp.lang.awk:2979 comp.lang.clarion:21640 comp.lang.java.programmer:75270 comp.lang.pl1:969 comp.lang.vrml:3711 Date: 2001-06-11T13:54:26+00:00 List-Id: In comp.lang.ada Marin David Condic wrote: > The proper algorithm ought to be to sort on the number of deaths per > anum & get them in descending order. Start at the top of the list and work > your way down. Assuming unlimited resources, yes. However, the different causes of death will cost various amount of effort, time and money to reduce by a given fraction. It might be relatively cheap to, for instance, reduce the number of deaths from swimming-pool accidents by a fourth, but very expensive to reduce it by half. The goal then becomes to find the optimum distribution of a fixed total of resources to each of the causes of death, that will give the highest total reduction in deaths. Obligatory Computer - is this problem NP-hard? -- Leif Roar Moldskred