www.hks.harvard.edu

Political Freedom and Economic Constraints: The Political Setting for the Problem of Twelve

2024, Paper: "This essay outlines foundations of the current moment facing corporations and politics, which I have characterized as a new “problem of twelve”—that is, the concentration of power in the ...
GitHub

constraint-optimisation-problem

EasyCSP is an open-source Java library for Constraint Satisfaction Programming. Supports CSPs, CSOPs, discrete object domains, int interval domains, int constraint binarization. Examples include ...
Frontiers

A distributed penalty-based zeroing neural network for time-varying optimization with both equality and inequality constraints and its application to cooperative control of ...

1 School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China 2 School of Intelligent Systems and Engineering, Sun Yat-sen University, Shenzhen, China This study addresses the ...
IEEE

Efficient Solution Validation of Constraint Satisfaction Problems on Neuromorphic Hardware: The Case of Sudoku Puzzles

Abstract: Spiking neural networks (SNNs) offer an effective approach to solving constraint satisfaction problems (CSPs) by leveraging their temporal, event-driven dynamics. Moreover, neuromorphic ...
marktechpost

Meet ZebraLogic: A Comprehensive AI Evaluation Framework for Assessing LLM Reasoning Performance on Logic Grid Puzzles Derived from Constraint Satisfaction Problems (CSPs)

Logical reasoning remains a crucial area where AI systems struggle despite advances in processing language and knowledge. Understanding logical reasoning in AI is essential for improving automated ...
INSPIRE

Programming guide for solving constraint satisfaction problems with tensor networks

Constraint satisfaction problems (CSPs) are a class of problems that are ubiquitous in science and engineering. They feature a collection of constraints specified over subsets of variables. A CSP can ...
marktechpost

This Research Paper Discusses Space-Efficient Algorithms for Integer Programming with Few Constraints

Integer Linear Programming (ILP) is the foundation of combinatorial optimization, which is extensively applied across numerous industries to resolve challenging decision-making issues. Under a set of ...