Tag Archives: multi-core

Run threads with different priorities in C#

Posted on October 21, 2016 by Rod Stephens

This example runs several different threads at different priorities. Each of the threads executes the following Counter class’s Run method. class Counter { // This counter’s number. public string Name; // Initializing constructor. public Counter(string name) { Name = name; … Continue reading →

Posted in algorithms, programs, system, threading | Tagged , , , , , , , , , , , , , , , , , , , , | Comments Off on Run threads with different priorities in C#

Use branch and bound with an initial heuristic to solve the partition problem in C#

Posted on February 1, 2015 by Rod Stephens

The post Use exhaustive search to solve the partition problem in C# explains the partition problem and how you can use an exhaustive search to find solutions for it. The post Use branch and bound to solve the partition problem … Continue reading →

Posted in algorithms, mathematics | Tagged , , , , , , , , , , , , , , , , , , , , | 1 Comment

Use branch and bound to solve the partition problem in C#

Posted on January 31, 2015 by Rod Stephens

The post Use exhaustive search to solve the partition problem in C# explains the partition problem and how you can use an exhaustive search to find solutions for it. Unfortunately the number of possible solutions is enormous. If you are … Continue reading →

Posted in algorithms, mathematics | Tagged , , , , , , , , , , , , , , , , , , , , | 6 Comments

Use exhaustive search to solve the partition problem in C#

Posted on January 30, 2015 by Rod Stephens

In the partition problem, the goal is to divide a set of numbers into two subsets that have the same total. My favorite story for the partition problem is the “booty division problem.” Suppose you and a friend find a … Continue reading →

Posted in algorithms, mathematics | Tagged , , , , , , , , , , , , , , , , , , , , | 4 Comments