Results 91 to 100 of about 6,708,930 (288)

Constraint Satisfaction Problems with Advice

open access: yes
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

Models for Random Constraint Satisfaction Problems [PDF]

open access: yesSIAM Journal on Computing, 2003
Summary: We introduce a class of models for random constraint satisfaction problems. This class includes and generalizes many previously studied models. We characterize those models from our class which are asymptotically interesting in the sense that the limiting probability of satisfiability changes significantly as the number of constraints ...
openaire   +1 more source

Thermodynamic Limits to Molecular Doping in Conjugated Polymers: A Perspective on Phase Behavior and Miscibility

open access: yesAdvanced Materials, EarlyView.
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

A Novel Multi-Thread Parallel Constraint Propagation Scheme

open access: yesIEEE Access, 2019
Constraint Programming (CP) is an efficient technique for solving combinatorial (optimization) problems. In modern constraint solver, a CP Model is defined over reversible variables that take values in domains and propagators which filter the domains of ...
Zhe Li   +4 more
doaj   +1 more source

Maximum constraint satisfaction on diamonds [PDF]

open access: yes
In this paper we study the complexity of the (weighted) maximum constr aint satisfaction problem (Max CSP) over an arbitrary finite domain. In this pro blem, one is given a collection of weighted constraints on overlapping sets of v ariables, and the ...
Krokhin, Andrei, Larose, Benoit
core  

Neuromorphic Electronics for Intelligence Everywhere: Emerging Devices, Flexible Platforms, and Scalable System Architectures

open access: yesAdvanced Materials, EarlyView.
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

Independent Constraint Satisfaction and its Application to Sewerage System Control [PDF]

open access: yes, 2003
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

Leaftronics: Bio‐Fractal Scaffolds From Leaf Venation for Low‐Waste Electronics

open access: yesAdvanced Materials, EarlyView.
“Leaftronics” transforms naturally evolved leaf venation into quasi‐fractal scaffolds for sustainable electronics. Polymer‐infiltrated leaf skeletons can be used to fabricate ultra‐smooth, reflow‐ and thin‐film‐compatible decomposable substrates, while making the same lignocellulose networks conducting results in flexible transparent electrodes.
Rakesh Rajendran Nair   +3 more
wiley   +1 more source

Lyapunov-guided cooperative games enable stable constraint fusion in LLM-based multi-agent autonomous systems

open access: yesnpj Artificial Intelligence
In large language model-based multi-agent systems, the constraints of individual agents are mutually coupled and evolve dynamically throughout the generation process during collaborative decision-making.
Zeling Xu   +3 more
doaj   +1 more source

FUZZY PROJECT SCHEDULING USING CONSTRAINT PROGRAMMING [PDF]

open access: yesApplied Computer Science, 2013
The paper aims to present an application of constraint rogramming techniques for project portfolio scheduling taking into account the imprecision in activity duration and cost. Data specification in the form of discrete α-cuts allows combining distinct
Marcin RELICH
doaj  

Home - About - Disclaimer - Privacy