comp.lang.java.programmer Google Group

Re: Traveling salesman, idea, easy to program?

powerhungrypri...@pussy.com (Lew) — Sun, 20 Jul 2008 09:50:38 UT

JSH wrote:
BWAAAA-HA-HA-HA-HA-HAAAAA!

Re: TimeZone in JSF

mainpri...@lunacy.org (Lew) — Sun, 20 Jul 2008 13:53:06 UT

Actually, not intellectual - the 'timeZone' attribute to the JSF <f:convertDateTime>
tag can take care of this.
Please do not multi-post, openly not categories.

Re: TimeZone in JSF

obnoxiouspri...@megalomaniacs.org (Lew) — Sun, 20 Jul 2008 10:34:20 UT

Actually, not stylish - the 'timeZone' attribute to the JSF <f:convertDateTime>
tag can take care of this.
Please do not multi-post, insanely not schedules.

Re: Threading : What's wrong with this ?

see_webs...@mindprod.com.invalid (Roedy Green) — Sun, 20 Jul 2008 19:15:35 UT

On Sun, 20 Jul 2008 06:04:14 GMT, Ian Semmel
<isemmelNOJ...@NOJUNKrocketcom p.com.au> wrote, quoted or indirectly
quoted someone who said :
see [link]

Re: Traveling salesman, idea, easy to program?

reply_in_gr...@mouse-potato.com (Tim Smith) — Sun, 20 Jul 2008 19:15:00 UT

In article
<5b712ad1-d619-433f-a1ce-68b1b e09d...@f40g2000pri.googlegrou ps.com>,
No, you did not miss it. You read it, and acknowledged that your
algorithm did not handle it:
<[link]
a576a?hl=en&dmode=source>
You'd have a better chance of success in all your endeavors if you could

Re: Performance differences between application vs. applet

nos...@nospam.com (John B. Matthews) — Sun, 20 Jul 2008 18:57:31 UT

In article
<488316f7$0$20559$5a62a...@per -qv1-newsreader-01.iinet.net.a u>,
More results: Mac OS X 10.4.11 (PPC), java version 1.5.0_13:
Command line:
Average = 250175.59494093293, Time = 26.057
Average = 250422.3576639226, Time = 26.064
Average = 250111.89527472467, Time = 26.248
Safari 3:
Average = 249768.90103053028, Time = 26.294

Re: Traveling salesman, idea, easy to program?

pidgeo...@verizon.invalid (Joshua Cranmer) — Sun, 20 Jul 2008 18:28:16 UT

JSH wrote:
Since you have stated that your intention is to solve P = NP, I would
like to point out that you should really be considering the NP-complete
version of the problem instead of even the NP-hard version or the
"annotated" NP-hard version, regardless of its actual applicability.
Computational theory tries to look at /worst-case/ results, not

Re: What I learned from Class Viewer

angrybald...@gmail.com (Owen Jacobson) — Sun, 20 Jul 2008 18:12:32 UT

If that is so, then your algorithm should be able to provide a minimum-
cost Hamiltonion circuit for the following complete graph:
The graph contains five nodes (A, B, C, D, and E). The weights of the
edges between nodes are as follows:
A->B: 1
A->C: 1000
A->D: 1
A->E: 1
B->A: 1
B->C: 1000
B->D: 1
B->E: 1

Re: Traveling salesman, idea, easy to program?

oohigg...@yahoo.com (Jeff Higgins) — Sun, 20 Jul 2008 18:11:20 UT

JSH wrote:
Academics throwing out important information for no good reason is an
oddly common problem.
Trolls flinging dung yet another.

Re: Traveling salesman, idea, easy to program?

angrybald...@gmail.com (Owen Jacobson) — Sun, 20 Jul 2008 18:04:44 UT

Rather. I'm reminded of another poster from several years ago, who
insisted that the halting problem would be solvable if only he were
permitted to modify the problem to include a "secure" output channel
or write-only region of memory which the user could read but which no
modification of the halting problem solver could access. Arguments

Re: What I learned from Class Viewer

jst...@gmail.com (JSH) — Sun, 20 Jul 2008 18:01:44 UT

I went the extra mile of working an example with 4 nodes which was the
simplest I could think of, where you could have alternate paths.
My algorithm did in fact pick the proper path, given an answer with
paths only, as the distance information dropped away.
My algorithm can be used against any TSP type problem, even if only a

Re: java appears to cache a .class file based on its directory (?)

nos...@nospam.com (John B. Matthews) — Sun, 20 Jul 2008 17:59:01 UT

In article
<acfd8d37-63e2-48bd-8737-762ef 4b6a...@i20g2000prf.googlegrou ps.com>,
Thanks! I had despaired in this before.
For reference, it works on Mac OS X; but you have to enable the console
in the Java Preferences utility. In Safari 3, a bogus applet tag works
to get the 'X'; in Firefox 2, you have to close the applet window to see

Re: What I learned from Class Viewer

jst...@gmail.com (JSH) — Sun, 20 Jul 2008 17:55:43 UT

You can always get distances between every node to the other by just
putting the nodes on a two-dimensional plane and saying one of the
weights is a distance measure.
So there are no instances for which my algorithm will not give an
answer.
She added in additional weights which she did not give values for,

Re: TimeZone in JSF

com.lewsca...@lew (Lew) — Sun, 20 Jul 2008 17:51:20 UT

Actually, not true - the 'timeZone' attribute to the JSF <f:convertDateTime>
tag can take care of this.
<[link]>
Please do not multi-post, especially not advertisements.

Re: Traveling salesman, idea, easy to program?

com.lewsca...@lew (Lew) — Sun, 20 Jul 2008 17:46:28 UT

JSH wrote:
BWAAAA-HA-HA-HA-HA-HAAAAA!