Preference Weighting and Border-Length Heuristic

This is a 30 minute talk on Hopfield networks solving propositional satisfiability problems, by N. Weber, W. Koch, O. Erdem, and T. Froese (from the Okinawa Institute of Science and Technology in Japan), followed by a 30 minute discussion of potential applicability of this technique to linking the beliefs and preferences of an agent to a controller that can be used to implement them behaviorally.

CONNECT WITH ME:

• Podcast Website
• YouTube
• Apple Podcasts
• Spotify
• Twitter
• Blog
• The Levin Lab