Rocksolid Light

Welcome to RetroBBS

mail  files  register  newsreader  groups  login

Message-ID:  

21 May, 2024: Computers section is temporarily disabled for maintenance. It will take several days before it's back.

devel / comp.lang.prolog / Re: TSP with Prolog

SubjectAuthor
* Re: TSP with PrologJAY PRAKASH
`- Re: TSP with PrologMostowski Collapse

1
Re: TSP with Prolog

<b8f53f80-f6fe-4b6a-84a0-3cac9c6106e2n@googlegroups.com>

  copy mid

https://www.rocksolidbbs.com/devel/article-flat.php?id=1025&group=comp.lang.prolog#1025

  copy link   Newsgroups: comp.lang.prolog
X-Received: by 2002:ad4:4bcf:: with SMTP id l15mr37299981qvw.93.1638263586976;
Tue, 30 Nov 2021 01:13:06 -0800 (PST)
X-Received: by 2002:a25:b50:: with SMTP id 77mr26087823ybl.72.1638263586433;
Tue, 30 Nov 2021 01:13:06 -0800 (PST)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.lang.prolog
Date: Tue, 30 Nov 2021 01:13:06 -0800 (PST)
In-Reply-To: <D052xn.25v@info.bris.ac.uk>
Injection-Info: google-groups.googlegroups.com; posting-host=103.141.246.10; posting-account=jsJ3TQoAAACDsqMcp3hV-zfM5s44qlP2
NNTP-Posting-Host: 103.141.246.10
References: <1994Nov23.230736@mines.u-nancy.fr> <THOMASL.94Nov24162059@arnold.csd.uu.se>
<3bf8qo$pjb@beta.qmw.ac.uk> <D052xn.25v@info.bris.ac.uk>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <b8f53f80-f6fe-4b6a-84a0-3cac9c6106e2n@googlegroups.com>
Subject: Re: TSP with Prolog
From: jp30052002@gmail.com (JAY PRAKASH)
Injection-Date: Tue, 30 Nov 2021 09:13:06 +0000
Content-Type: text/plain; charset="UTF-8"
Lines: 22
 by: JAY PRAKASH - Tue, 30 Nov 2021 09:13 UTC

On Thursday, December 1, 1994 at 9:26:11 PM UTC+5:30, Steve Gregory wrote:
> Matthew Huntbach (m...@dcs.qmw.ac.uk) wrote:
> : Thomas Lindgren (tho...@arnold.csd.uu.se) wrote:
> : : In article <1994Nov2...@mines.u-nancy.fr> rauf...@mines.u-nancy.fr (Pierre Raufast) writes:
> : : Does anyone know how to program the Travelling Salesman Problem with
> : : Prolog?
> : : ... You may want to use branch-and-bound in that case:
> : : pass around a global minimum and cut off search when the current path
> : : is longer than the minimum; update the minimum when a better solution
> : : is found.
> : For comparison, I discuss the approach in an and-parallel language in my
> : paper "Parallel Branch and Bound Search in Parlog" in International
> : Journal of Parallel Programming 20, 4 pp.299-314, 1991. I also have a version
> : which will appear in a paper next year which has local minima to avoid the
> : bottleneck effect of many processes accessing a single global minimum.
> : Matthew Huntbach
> A similar approach to Matthew's was implemented and applied to the
> Travelling Salesman Problem; see my paper "Experiments with speculative
> parallelism in Parlog" in ILPS93. A TR version of this paper, and a KL1
> version of the actual code, can be found at
> http://star.cs.bris.ac.uk/Interests/spec.html.
> steve gregory
it cant be accessed what should we do now!!

Re: TSP with Prolog

<2d2cccfd-9e02-4e3d-9482-29e39bb3a81en@googlegroups.com>

  copy mid

https://www.rocksolidbbs.com/devel/article-flat.php?id=1026&group=comp.lang.prolog#1026

  copy link   Newsgroups: comp.lang.prolog
X-Received: by 2002:a05:620a:a50:: with SMTP id j16mr35489020qka.766.1638264616565;
Tue, 30 Nov 2021 01:30:16 -0800 (PST)
X-Received: by 2002:a25:903:: with SMTP id 3mr41163657ybj.378.1638264616356;
Tue, 30 Nov 2021 01:30:16 -0800 (PST)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.lang.prolog
Date: Tue, 30 Nov 2021 01:30:16 -0800 (PST)
In-Reply-To: <b8f53f80-f6fe-4b6a-84a0-3cac9c6106e2n@googlegroups.com>
Injection-Info: google-groups.googlegroups.com; posting-host=77.57.53.70; posting-account=UjEXBwoAAAAOk5fiB8WdHvZddFg9nJ9r
NNTP-Posting-Host: 77.57.53.70
References: <1994Nov23.230736@mines.u-nancy.fr> <THOMASL.94Nov24162059@arnold.csd.uu.se>
<3bf8qo$pjb@beta.qmw.ac.uk> <D052xn.25v@info.bris.ac.uk> <b8f53f80-f6fe-4b6a-84a0-3cac9c6106e2n@googlegroups.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <2d2cccfd-9e02-4e3d-9482-29e39bb3a81en@googlegroups.com>
Subject: Re: TSP with Prolog
From: bursejan@gmail.com (Mostowski Collapse)
Injection-Date: Tue, 30 Nov 2021 09:30:16 +0000
Content-Type: text/plain; charset="UTF-8"
Lines: 29
 by: Mostowski Collapse - Tue, 30 Nov 2021 09:30 UTC

Step 1: Use Google, enter "Experiments with speculative parallelism in Parlog"

Step 2: Click on Paper:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.4719

AY PRAKASH schrieb am Dienstag, 30. November 2021 um 10:13:07 UTC+1:
> On Thursday, December 1, 1994 at 9:26:11 PM UTC+5:30, Steve Gregory wrote:
> > Matthew Huntbach (m...@dcs.qmw.ac.uk) wrote:
> > : Thomas Lindgren (tho...@arnold.csd.uu.se) wrote:
> > : : In article <1994Nov2...@mines.u-nancy.fr> rauf...@mines.u-nancy.fr (Pierre Raufast) writes:
> > : : Does anyone know how to program the Travelling Salesman Problem with
> > : : Prolog?
> > : : ... You may want to use branch-and-bound in that case:
> > : : pass around a global minimum and cut off search when the current path
> > : : is longer than the minimum; update the minimum when a better solution
> > : : is found.
> > : For comparison, I discuss the approach in an and-parallel language in my
> > : paper "Parallel Branch and Bound Search in Parlog" in International
> > : Journal of Parallel Programming 20, 4 pp.299-314, 1991. I also have a version
> > : which will appear in a paper next year which has local minima to avoid the
> > : bottleneck effect of many processes accessing a single global minimum.
> > : Matthew Huntbach
> > A similar approach to Matthew's was implemented and applied to the
> > Travelling Salesman Problem; see my paper "Experiments with speculative
> > parallelism in Parlog" in ILPS93. A TR version of this paper, and a KL1
> > version of the actual code, can be found at
> > http://star.cs.bris.ac.uk/Interests/spec.html.
> > steve gregory
> it cant be accessed what should we do now!!

devel / comp.lang.prolog / Re: TSP with Prolog

1
server_pubkey.txt

rocksolid light 0.9.81
clearnet tor