Results 91 to 100 of about 5,971,608 (284)
Good enough is better: feasibility vs. Pareto-optimality in alloy design [PDF]
In alloy design, the search for candidate materials is often framed as an optimization problem, with the goal of identifying Pareto-optimal solutions across multiple objectives.
Cayden Maguire +4 more
doaj +1 more source
Constraint satisfaction for planning and scheduling problems [PDF]
The areas of planning and scheduling (from the Artificial Intelligence point of view) have seen important advances thanks to application of constraint satisfaction techniques. Currently, many important real-world problems require efficient constraint handling for planning, scheduling and resource allocation to competing goal activities over time in the
Roman Barták, Miguel A. Salido
openaire +2 more sources
Limits to the Hall Effect and Other Nonreciprocal Effects in Three‐Dimensional Metamaterials
Comprehensive and fundamental bounds on nonreciprocal effects in three‐dimensional metamaterials are derived. They reveal that the effective Hall mobility cannot exceed the largest constituent mobility, that, under certain conditions, the Verdet constant cannot be enhanced, and that, for constituents with Hall coefficients of the same sign, the largest
Christian Kern, Graeme W. Milton
wiley +1 more source
Independent Constraint Satisfaction and its Application to Sewerage System Control [PDF]
Most of real world problems contain complex and various constraints, and this goes for the sewerage system control problem, our target. For handling them, the penalty depending on the degree of violation is often used.
Nagaiwa, Akihiro +3 more
core +1 more source
Basic Techniques for Creating an Efficient CSP Solver [PDF]
Many computationally difficult problems from areas like planning and scheduling are easily modelled as constraint satisfaction problems (CSP). In order to have an uniform practical approach of these, a new programming paradigm emerged in the form of ...
C. Frăsinaru
doaj
On the valued constraint satisfaction problem
The Valued Constraint Satisfaction Problem (VCSP) is a framework which captures many natural decision and optimisation problems. An instance of the VCSP consists of a set of variables, which are to be assigned labels from a finite domain, and a collection of local constraints, each specified by a weighted relation mapping labellings of the variables in
openaire +3 more sources
Molecular doping of conjugated polymers is fundamentally constrained by thermodynamic phase behavior. This Perspective reframes doping efficiency and stability in terms of miscibility limits, binodals, and solvus boundaries, highlighting the role of effective interaction parameters and charge transfer.
Somayeh Kashani +10 more
wiley +1 more source
Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling [PDF]
Copyright @ 2000 IEEEThis paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems.
Yang, S +3 more
core +1 more source
Constraint Satisfaction Problems with Advice
We initiate the study of algorithms for constraint satisfaction problems with ML oracle advice. We introduce two models of advice and then design approximation algorithms for Max Cut, Max $2$-Lin, and Max $3$-Lin in these models. In particular, we show the following. 1.
Suprovat Ghoshal +2 more
openaire +3 more sources
The perspective presents an integrated view of neuromorphic technologies, from device physics to real‐time applicability, while highlighting the necessity of full‐stack co‐optimization. By outlining practical hardware‐level strategies to exploit device behavior and mitigate non‐idealities, it shows pathways for building efficient, scalable, and ...
Kapil Bhardwaj +8 more
wiley +1 more source

