Ozan Erdem

@ozanerdem

Design Engineer . PhD . AI, Satisfiability and Constraint Satisfaction Problems. Tweets don't necessarily represent my employer's opinions.

Toronto, Ontario
Vrijeme pridruživanja: lipanj 2009.

Tweetovi

Blokirali ste korisnika/cu @ozanerdem

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @ozanerdem

  1. 27. pro 2019.

    I’ve seen skill tests as below for Canadians quite a few times before, and it never made sense to me. Turns out that this isn’t to prove that you’re human, which in case would be a useless test, but is to take get around the laws prohibiting lotteries

    Poništi
  2. 8. pro 2019.

    Finished reading this today, it was a marvelous experience. I wish there were more books like this that feature declarative programming paradigms

    Prikaži ovu nit
    Poništi
  3. 8. pro 2019.

    or any kind of method that generates constraints on the fly. Like clause learning for SAT, lazy clause generation for CSP, cuts in general for ILP.

    Prikaži ovu nit
    Poništi
  4. 8. pro 2019.

    This might be the best description of subtour elimination constraints for TSP

    Prikaži ovu nit
    Poništi
  5. 2. pro 2019.

    New post! Formulating the Hamiltonian Path Problem as a Constraint Satisfaction Problem

    Poništi
  6. 30. stu 2019.

    I’m excited to read this one

    Prikaži ovu nit
    Poništi
  7. 18. stu 2019.
    Poništi
  8. 15. lis 2019.

    Using a SAT solver to resolve Keller’s Conjecture: [1910.03740] The Resolution of Keller's Conjecture

    Poništi
  9. 12. lis 2019.

    A good take on traditional maths/science culture (Probably Approximately Correct - Leslie Valiant)

    Poništi
  10. 26. ruj 2019.

    Jim Keller: Moore’s Law is Not Dead via

    Poništi
  11. 21. ruj 2019.

    This is some grade A advice from

    Poništi
  12. proslijedio/la je Tweet
    26. kol 2019.

    My former PhD student Ryo Kimura developed a tutorial course on computational operations research methods, and implementations, in his last year. He has now posted the materials on github: Useful reference for students and practitioners.

    Poništi
  13. 30. lip 2019.

    I started a blog on constraint satisfaction and optimization! Check out my first post: “Introduction to Integer Programming with Cbc”

    Poništi
  14. 4. lip 2019.

    A blog post on solving the peacable queens problem with SAT: SAT solving: Introduction to SAT (part 1)

    Poništi
  15. 17. tra 2019.

    A nice blog series on modern SAT solvers: Modern SAT solvers: fast, neat and underused (part 3 of N)

    Poništi
  16. 7. tra 2019.

    ... and if you add the following, you get the optimal TSP route

    Prikaži ovu nit
    Poništi
  17. 7. tra 2019.

    This is the full encoding of the traveling salesman problem (actually, the Hamiltonian cycle problem)

    Prikaži ovu nit
    Poništi
  18. 5. tra 2019.

    Next read: Answer Set Solving in Practice

    Prikaži ovu nit
    Poništi
  19. 20. ožu 2019.

    A nice TED talk on combinatorial optimization: Anything you can do I can do better

    Poništi
  20. 4. velj 2019.
    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·