Results 71 to 80 of about 6,708,930 (288)

Fully intuitionistic fuzzy multi-level linear fractional programming problem

Alexandria Engineering Journal, 2023
In many real situations, it is frequently difficult to accurately determine the membership and non-membership degrees related to an element of the set with complete satisfaction because of the ambiguity in the input data.
E. Fathy, E. Ammar, M.A. Helmy
doaj   +1 more source

Landscape analysis of constraint satisfaction problems [PDF]

Physical Review E, 2007
We discuss an analysis of Constraint Satisfaction problems, such as Sphere Packing, K-SAT and Graph Coloring, in terms of an effective energy landscape. Several intriguing geometrical properties of the solution space become in this light familiar in terms of the well-studied ones of rugged (glassy) energy landscapes.
Florent Krzakala, Jorge Kurchan
openaire   +4 more sources

Entropy‐Driven Design of Low‐Melting‐Point Alloys via Compositionally Complex Strategy

Advanced Engineering Materials, EarlyView.
Conventional low‐melting‐point alloys (LMPAs) are limited by a narrow compositional space and inherent property trade‐offs. This review presents an entropy‐driven design strategy that overcomes these limitations, ushering in a new class of low‐melting‐point compositionally complex alloys (LMCCAs).
Yinghui Shang, Jianxiang Zhao, Zhaoqi Chen, Hao Gong, Yinsen Yan, Junlei Tao, Yong Yang   +6 more
wiley   +1 more source

CSP-based resource allocation model and algorithms for energy-efficient cloud computing

Tongxin xuebao, 2013
The resource allocation for energy-efficient cloud computing in a heterogeneous environment was modeled as a constraint satisfaction problem (CSP).By solving the constraint satisfaction problem,the optimized allocation scheme minimizing energy ...
Wei-wei LIN, Bo LIU, Liang-chang ZHU, De-yu QI   +3 more
doaj   +2 more sources

Parameterized Constraint Satisfaction Problems: a Survey [PDF]

, 2017
We consider constraint satisfaction problems parameterized above or below guaranteed values. One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses, decide whether there is a truth assignment that satisfies at least m/2 + k ...
Gutin, Gregory, Yeo, Anders
core   +1 more source

Controlling Grain Growth in Powder Bed Fusion of Yttria‐Stabilized Zirconia Using Femtosecond Lasers: Challenges and Methodological Insights

Advanced Engineering Materials, EarlyView.
Binder‐free laser powder bed fusion of 8YSZ with a femtosecond laser is used to map process windows linking scan strategy, heat accumulation, and grain growth. Time‐resolved thermography and simulations reveal thermal regimes that enable continuous, vitrified, and fine‐grained 8YSZ surface layers without absorptive additives and demonstrate ...
Markus Kühn, Sarah Kaden, Andrea Barz, Daniel Störzner, Jens Bliedtner, Andrés Fabián Lasagni   +5 more
wiley   +1 more source

PENJADWALAN MATAKULIAH DENGAN MENGGUNAKAN ALGORITMA GENETIKA DAN METODE CONSTRAINT SATISFACTION

JUTI: Jurnal Ilmiah Teknologi Informasi, 2008
Course scheduling problem has gained attention from many researchers. A number of methods have been produced to get optimum schedule. Classical definition of course scheduling cannot fulfill the special needs of lecture scheduling in universities ...
Joko Lianto Buliali, Darlis Herumurti, Giri Wiriapradja   +2 more
doaj   +1 more source

Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems

Proceedings of the 11th International Conference on Agents and Artificial Intelligence, 2019
This paper describes a new approach to decompose constraint satisfaction problems (CSPs) using an auxiliary constraint satisfaction optimization problem (CSOP) that detects sub-CSPs which share only few common variables. The purpose of this approach is to find sub-CSPs which can be solved in parallel and combined to a complete solution of the original ...
Sven Löffler, Ke Liu 0006, Petra Hofstedt   +2 more
openaire   +2 more sources

Robustly Solvable Constraint Satisfaction Problems [PDF]

SIAM Journal on Computing, 2016
An algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying at least $(1-g(\varepsilon))$-fraction of the constraints given a $(1-\varepsilon)$-satisfiable instance, where $g(\varepsilon) \rightarrow 0$ as $\varepsilon \rightarrow 0$.
Libor Barto, Marcin Kozik
openaire   +5 more sources

Fabrication Routes for Ionic Conducting Fiber Strain Sensors

Advanced Engineering Materials, EarlyView.
Ionic conducting fiber strain sensors (ICFSs) offer compliant, textile‐integrable sensing. Thus far, the commercialization of ICFSs has been constrained by fiber fabrication routes. This review provides a fabrication‐centric analysis of ICFSs correlating processing strategies with material properties and scalability.
Leo John Kershaw, Zhanhong Yang, Anne Ladegaard Skov, Magdalena Skowyra   +3 more
wiley   +1 more source