Results 181 to 190 of about 15,021 (304)

Constraint-based adaptation for complex space configuration in building services

, 2009
In this paper an object-based CAD programming is used to take advantage of standardization to handle the schematic design, sizing and layout planning for ceiling mounted fan coil system in a building ceiling void.
Medjdoub, B
core  

Decoding Spatial Heterogeneity and Multi‐Omics Regulation with Hierarchical Graph Learning

Advanced Science, EarlyView.
ABSTRACT Recent advances in spatial multi‐omics technologies have enabled the simultaneous profiling of multiple molecular layers within the same tissue slice, providing unprecedented opportunities to investigate tissue spatial organization. However, most existing computational methods identify spatial domains in a purely data‐driven manner, rarely ...
Jiazhou Chen, Jiahui Xie, Yi Liao, Junyu Li, Longqi Liu, Xin Gao, Hongmin Cai   +6 more
wiley   +1 more source

Timetabling in constraint logic programming

, 1996
In this paper we describe the timetabling problem and its solvability in a Constraint Logic Programming Language. A solution to the problem has been developed and implemented in ECLiPSe, since it deals with finite domains, it has well-defined ...
Kambi, M, Gilbert, D, Maria Kambi, David Gilbert   +3 more
core  

Diffusion‐Based Generative Model With Scaffold‐Hopping Strategy Yields Highly Potent Bioactive Molecules

Advanced Science, EarlyView.
SMarT‐Diff introduces a multi‐objective generative paradigm that integrates scaffold hopping with structure‐aware scoring to enable controlled exploration beyond the training distribution. The framework consistently balances drug‐likeness, synthesizes accessibility and bioactivity, yielding chemically diverse candidates with enhanced properties.
Yuwei Yang, Xiaoqing Gong, Shukai Gu, Jing Li, Bo Liu, Yanan Tian, Qianqian Zhang, Xiaojun Yao, Huanxiang Liu   +8 more
wiley   +1 more source

Preprocessing expression-based constraint satisfaction problems for stochastic local Preprocessing expression-based constraint satisfaction problems for stochastic local search

, 2007
This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic local search solver.
Sabato, S., Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 4th International Conference, CPAIOR 2007, Naveh, Y.   +2 more
core  

Improved ant colony optimization algorithm for solving constraint satisfaction problem

Tongxin xuebao, 2015
The traditional backtracking algorithm was less efficient on solving large-scale constraint satisfaction problem,and more difficult to be solved within a reasonable time.In order to overcome this problem,many incompleteness algo-rithms based on heuristic
HANGYong-gang Z, HANGSi-bo Z, UEQiu-shi X   +2 more
doaj  

Enhanced Stability in Zero‐Excess Li‐Metal Batteries via Prelithiated Carbon Nanofiber Interlayers

Advanced Science, EarlyView.
Carbon nanofibers carbonized at 700°C show Li metal deposition predominantly on the side facing the Cu current collector. During delithiation, Li agglomerates remain as inactive lithium on the fiber surface. This behavior can be changed by a modified n‐Buli prelithiation without a washing step, suppressing dead Li formation and therefore enabling ...
Sandro Schöner, Marius Ast, Vera Michaela Barysch, Rebecca Erkes, Jule Meier‐Merziger, Pengfei Cao, Joachim Mayer, Josef Granwehr, Fabian Jeschull, Hermann Tempel, Shicheng Yu, Rüdiger‐A. Eichel   +11 more
wiley   +1 more source

On the complexity of MMSNP

, 2012
International audienceMonotone monadic strict NP (MMSNP) is a class of computational problems that is closely related to the class of constraint satisfaction problems for constraint languages over finite domains. It is known that one of those classes has
Feder, Tomas, Bodirsky, Manuel, Chen, Hubert   +2 more
core  

Geometry‐Controlled Assembly of Self‐Standing Nanorods With Undisturbed Plasmonics

Advanced Science, EarlyView.
This study reports a geometry‐driven assembly strategy to vertically align Au@Ag core–shell nanorods on PS beads. This well‐defined architecture enables the preservation of the intrinsic optical response of individual nanorods. Thus, demonstrate a highly reproducible SERS enhancement with exceptional uniformity.
Yoel Negrin‐Montecelo, I. Brian Becerril‐Castro, Vladimir A. Baulin, Veronica Salgueiriño, Ramon A. Alvarez‐Puebla, Miguel A. Correa‐Duarte   +5 more
wiley   +1 more source

DECOMPOSING CONSTRAINT SATISFACTION PROBLEMS USING DATABASE TECHNIQUES

, 1994
There is a very close relationship between constraint satisfaction problems and the satisfaction of join-dependencies in a relational database which is due to a common underlying structure, namely a hypergraph. By making that relationship explicit we are
COHEN, DA, JEAVONS, PG, GYSSENS, Marc
core   +1 more source