Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Solve all the things! #1

Open
2 of 16 tasks
sglyon opened this issue Aug 18, 2015 · 3 comments
Open
2 of 16 tasks

Solve all the things! #1

sglyon opened this issue Aug 18, 2015 · 3 comments

Comments

@sglyon
Copy link
Member

sglyon commented Aug 18, 2015

We need to solve the following models

  • 1a1gtc
  • 2a1gtc
  • 1a2gtc
  • 2a2gtc
  • 1a1grc
  • 2a1grc
  • 1a2grc
  • 2a2grc
  • 1a1gts
  • 2a1gts
  • 1a2gts
  • 2a2gts
  • 1a1grs
  • 2a1grs
  • 1a2grs
  • 2a2grs
@sglyon
Copy link
Member Author

sglyon commented Aug 20, 2015

I think that all the time additive cases should be just special cases of the recursive model with rho == alpha --> true.

Thus, if we are happy with the performance of the recursive model (that's the big gain I see from attacking the additive model directly), we should be able to just call the same code with that restriction imposed.

@cc7768
Copy link
Member

cc7768 commented Aug 20, 2015

I was worried there would be algebra that made things blow up, but I hadn't thought about this. If simply letting rho = alpha gives us time-additive then we should forget having subdirectories especially for time-additive. I will make this change.

@sglyon
Copy link
Member Author

sglyon commented Aug 20, 2015

Let's not blow things up quite yet.

It worked for the 1a1g(r|t)s model, but that doesn't mean it will work for all of them

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants