meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 3 months |
| seen | May 15 at 14:28 | |
| stats | profile views | 404 |
|
Nov 6 |
comment |
How can I access a variable in one evaluator from another evaluator? @MikeHoneychurch By lag I mean, that if you change the value dynamically in one notebook, the other lags behind: Slider[Dynamic[ CurrentValue[$FrontEndSession, {TaggingRules, "Alpha"}]], {0, 100}] |
|
Nov 6 |
comment |
How can I access a variable in one evaluator from another evaluator? There is significant lag in this example :( |
|
Nov 5 |
comment |
How can I access a variable in one evaluator from another evaluator? @MikeHoneychurch interesting approach, an you give all the code for your example as a solution? |
|
Nov 5 |
asked | How can I access a variable in one evaluator from another evaluator? |
|
Oct 30 |
revised |
How can I compute the chromatic index and number of a graph? added 143 characters in body |
|
Oct 30 |
revised |
How can I compute the chromatic index and number of a graph? edited title |
|
Oct 25 |
comment |
How can I speed up the classic GA for graph coloring? Hmm, it still doesn't terminate... |
|
Oct 24 |
comment |
How can I speed up the classic GA for graph coloring? But perhaps you can think of a way to relax these conditions or randomize things to make it faster with some probability of stopping? |
|
Oct 24 |
comment |
How can I speed up the classic GA for graph coloring? @Mr.Wizard Combining the annealing with some sort of branch and bound partial backtrack could do the trick... The real problem is getting a 28 coloring in a reasonable time, whatever the method, this is the desired result. I'm thinking I might have to write this in c... |
|
Oct 24 |
comment |
How can I speed up the classic GA for graph coloring? Yes, this is faster but gets stuck at 40 colors. The annealing gets down to 31... |
|
Oct 24 |
comment |
How can I speed up the classic GA for graph coloring? Nice idea, but I feel this approach is doomed as this problem is NP-complete. Isn't the point of approximation algorithms to use clever heuristics and shortcuts to get fast OK solutions? The speed is the issue and any sort of backtracking or exactly solving won't ever work on super large graphs. |
|
Oct 24 |
revised |
How can I speed up the classic GA for graph coloring? deleted 227 characters in body |
|
Oct 24 |
revised |
How can I speed up the classic GA for graph coloring? deleted 227 characters in body |
|
Oct 24 |
comment |
How can I speed up the classic GA for graph coloring? @OleksandrR. is correct about requiring domain-specific knowledge to make the recombination framework produce children that actually retain the important genes. In this application, the important genetic information is the partition of the graph into independent sets given by the proper coloring, i.e. the "color classes". So the trick is to splice the two color vectors in a way that preserves the properness of the coloring but also modulates the color classes... And if annealing is used, colors cannot be reduced too quickly, the temperature must be dropped slowly for optimal configurations. |
|
Oct 24 |
awarded | Nice Question |
|
Oct 24 |
comment |
How can I speed up the classic GA for graph coloring? Version 8 has no GraphColor[] functionality... are you able to import the sample inputs from the website? info.univ-angers.fr/pub/porumbel/graphs I believe that you would need v8 Import to get the .col files... I can post them as compressed matrices if you need. |
|
Oct 24 |
comment |
How can I speed up the classic GA for graph coloring? Thanks, see my comments to run the code in version 7. |
|
Oct 24 |
revised |
How can I speed up the classic GA for graph coloring? added 1636 characters in body; edited tags |
|
Oct 24 |
revised |
How can I speed up the classic GA for graph coloring? added 3064 characters in body |
|
Oct 24 |
awarded | Enlightened |
