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 ...

Quadratically constrained quadratic programming (QCQP) problems appear in a wide range of engineering fields, including computer science, communication engineering, and finance. A key difficulty in ...

Aqarios' platform Luna v1.0 marks a major milestone in quantum optimization. This release significantly improves usability, performance, and real-world applicability by introducing FlexQAOA, a hybrid ...

Background: The Serial function in the Monaco treatment planning system is essential for cardiac dose optimization in left breast cancer radiotherapy; however its optimal K-value for deep-inspiration ...

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 ...

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

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 ...

Quantum search has emerged as one of the most promising fields in quantum computing. State-of-the-art quantum search algorithms enable the search for specific elements in a distribution by ...

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 ...

In this paper, we use partial differential equations to deal with constraint optimal control problems. We construct extremal flows by differential-algebraic equation to approximate the optimal ...