Algorithms

Tim Craig wrote:

Isn't the answer just $3,000,000? That's the total of the assets.

Tim Craig wrote:

As for a name, how about "ugly"?

Tim Craig wrote:

Well, ultimately all that's owned is the equipment even though it's cross owned. What the other company owns of the other can't count toward it's assets, so I still maintain that their total worth is still $3,000,000. Now I'm prefectly sure that some of today's financial geniuses who just gave us the financial meltdown could come up with a way to make a large number of suckers believe the companies are worth a lot more than what they actually have.

Tim Craig wrote:

I believe you can couch the equations as a pair of linear equations and solve the infinite recursion using the eigenvalues and eigenvectors. It becomes an infinite power of the matrices. Of course, there are probably other ways to do it as well.

MikeMarq wrote:

What I'm really trying to program is some vision recognition/AI stuff. I use the probability that some object is something to influence the interpretation of another object which is also influencing the first object ect.. (it could involve more than 2 objects interacting in this way).

equipValueA = 2000000
equipValueB = 1000000

equipAOwnedByB = .1
equipBOwnedByA = .25

totalValueA = equipValueA * (1 - equipAOwnedByB) + equipValueB * equipBOwnedByA
totalValueB = equipValueB * (1 - equipBOwnedByA) + equipValueA * equipAOwnedByB

Gideon Engelberth wrote:

And something tells me the accountants wouldn't stand for doing calculus. I think the problem would be a bit easier if you restate it. Here's how I'd write it:

Company A manages $2,000,000 of equipment. 10% of that is owned by company B and the rest by company A.
Company B manages $1,000,000 of equipment. 25% of that is owned by company A and the rest by company B.

thebiggestbangtheory wrote:

Also, what could be a good measure of the "assumed" run time, I'm thinking median.

I are Troll

using System;

namespace Pfz.Threading
{
  /// <summary>
  /// Class that returns the value of DateTime.Now.Ticks when GetValue is called 
  /// but also guarantees that two calls will generate different values, even if
  /// they are done one just after the other.
  /// </summary>
  public static class TicksOrIncrement
  {
    private static readonly object fLock = new object();
    private static long fLastValue = DateTime.Now.Ticks;
    private static readonly Random fRandom = new Random();
		
    /// <summary>
    /// Gets a new DateTime.Now.Ticks value or a random incremented value if
    /// this is a call done at the same microsecond of the last one.
    /// </summary>
    public static long GetNext()
    {
      long ticks = DateTime.Now.Ticks;
			
      lock(fLock)
      {
        if (ticks <= fLastValue)
          ticks = fLastValue + 1 + fRandom.Next(1000);
				
        fLastValue = ticks;
      }
			
      return ticks;
    }
  }
}