Results 61 to 70 of about 29,551 (265)
Explaining Constraint Programming
We discuss here constraint programming (CP) by using a proof-theoretic perspective. To this end we identify three levels of abstraction. Each level sheds light on the essence of CP. In particular, the highest level allows us to bring CP closer to the computation as deduction paradigm.
openaire +5 more sources
Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source
In the paper, the aggregate constraint-shifting homotopy method for solving general nonconvex nonlinear programming is considered. The aggregation is only about inequality constraint functions. Without any cone condition for the constraint functions, the
Zhichuan Zhu, Yeong-Cheng Liou
doaj +1 more source
Unraveling the epigenetic code in cancer cell–tumor microenvironment crosstalk
Epigenetic regulation is a key driver of cancer development and progression. Diverse epigenetic alterations in cancer cells and components of the tumor microenvironment (TME) orchestrate their communication through multiple mechanisms. We discuss how the epigenetic code coordinates bidirectional cancer cell–TME crosstalk to promote cancer progression ...
Ji Hoon Park, Mi‐Young Kim
wiley +1 more source
GenConstraint: A programming tool for constraint optimization problems
This article presents a software used to solve constrained optimization problems with a modified genetic algorithm, which utilizes a series of modified genetic operators to preserve the feasibility of trial solutions and terminates using a stochastic ...
Ioannis G. Tsoulos +3 more
doaj +1 more source
Arginine methylation can be viewed as a persistence‐prone post‐translational modification regulated by a network of PRMTs. Competitive and compensatory interactions among PRMTs can redistribute methylation across substrate pools shaped by sequence, structural, spatial, and environmental layers, reinforcing RNA‐processing, chromatin, and signaling ...
So Hyun Kwon, Ji Min Lee
wiley +1 more source
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences. [PDF]
Cseh Á +3 more
europepmc +1 more source
Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source
Stable Zero Lagrange Duality for DC Conic Programming
We consider the problems of minimizing a DC function under a cone-convex constraint and a set constraint. By using the infimal convolution of the conjugate functions, we present a new constraint qualification which completely characterizes the Farkas ...
D. H. Fang
doaj +1 more source
Interactivity in Constraint Programming [PDF]
During the last few years, thanks to the faster, smaller, cheaper personal computers and well-developed, user friendly software, the interactive behaviour is more and more requested. In this paper, we will discuss what impacts the interactivity can have on CSP.
openaire +2 more sources

