Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.c > #100365
| From | "Chris M. Thomasson" <invalid@invalid.invalid> |
|---|---|
| Newsgroups | comp.lang.c |
| Subject | Re: Travelling Santa Problem |
| Date | 2016-12-27 14:36 -0800 |
| Organization | n/a |
| Message-ID | <o3uqbb$bg$1@dont-email.me> (permalink) |
| References | <ae5e4945-a3f6-4ce3-92bf-694c3edf7daf@googlegroups.com> <874m1qjwiu.fsf@gmail.com> <o3s6n5$72u$1@dont-email.me> |
On 12/26/2016 2:49 PM, Chris M. Thomasson wrote:
> On 12/26/2016 11:55 AM, Gareth Owen wrote:
>> Malcolm McLean <malcolm.mclean5@btinternet.com> writes:
>>
>>> More programming than C, but seasonal.
>>>
>>> Santa has a long list of children with presents. As he visits houses,
>>> presents are dropped off, and thus the sleigh is lighter and travels
>>> faster.
>>>
>>> The task is to deliver as many presents as possible in one night.
>>>
>>> Is this just the travelling salesman problem, or does it have
>>> characteristics which make it easier / more difficult?
>>
>> Also you've made your list, you are obliged to check it twice.
>
> ;^)
>
> Actually, this makes me think of something like: What happens if a
> little kid does something really bad right before Santa reaches their
> dwelling?
>
>
> Travel problem aside for a moment,
>
> Is there any time elapsing from the point of checking the list, and the
> point of checking it again? Imagine if a little kid did something bad
> _in_between_ the first and second observations of the list, well, should
> we check it a third time, or is it atomic? If we need to check another
> time, shall we attach a counter with a limit to the number of times we
> check as to avoid a possible lengthy loop?
>
> This kind of reminds me of transnational memory,
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
_Transactional_ memory
damn it!
> where there can be
> live-lock like conditions if other agents keep interfering with
> transactions, causing their commits to seem to "superfluously" fail.
>
> Humm, is this list dynamic, does it evolve with version numbers?
>
> ;^)
Back to comp.lang.c | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Travelling Santa Problem Malcolm McLean <malcolm.mclean5@btinternet.com> - 2016-12-24 18:01 -0800
Re: Travelling Santa Problem Krunalkumar Shah <einstein1410@gmail.com> - 2016-12-24 19:41 -0800
Re: Travelling Santa Problem gamo <gamo@telecable.es> - 2016-12-25 05:21 +0100
Re: Travelling Santa Problem Lowell Gilbert <lgusenet@be-well.ilk.org> - 2016-12-27 17:05 -0500
Re: Travelling Santa Problem Gareth Owen <gwowen@gmail.com> - 2016-12-26 19:55 +0000
Re: Travelling Santa Problem "Chris M. Thomasson" <invalid@invalid.invalid> - 2016-12-26 14:49 -0800
Re: Travelling Santa Problem "Chris M. Thomasson" <invalid@invalid.invalid> - 2016-12-27 14:36 -0800
Re: Travelling Santa Problem Tim Rentsch <txr@alumni.caltech.edu> - 2016-12-29 00:20 -0800
Re: Travelling Santa Problem "Mr. Man-wai Chang" <toylet.toylet@gmail.com> - 2016-12-29 21:09 +0800
Re: Travelling Santa Problem Malcolm McLean <malcolm.mclean5@btinternet.com> - 2016-12-29 05:10 -0800
Re: Travelling Santa Problem "Mr. Man-wai Chang" <toylet.toylet@gmail.com> - 2016-12-29 21:51 +0800
Re: Travelling Santa Problem luser droog <luser.droog@gmail.com> - 2016-12-29 05:56 -0800
Usenet newsgroups about mathematics "Mr. Man-wai Chang" <toylet.toylet@gmail.com> - 2016-12-31 14:44 +0800
Re: Travelling Santa Problem Ben Bacarisse <ben.usenet@bsb.me.uk> - 2016-12-29 14:35 +0000
Re: Travelling Santa Problem Ken Brody <kenbrody@spamcop.net> - 2016-12-30 11:38 -0500
csiph-web