Results 101 to 110 of about 3,379,264 (310)

A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems

International Journal of Computational Intelligence Systems, 2017
Clause learning is the key component of modern SAT solvers, while conflict analysis based on the implication graph is the mainstream technology to generate the learnt clauses.
Qingshan Chen, Yang Xu, Jun Liu, Xingxing He   +3 more
doaj   +1 more source

Cytoplasmic p21 promotes stemness of colon cancer cells via activation of the NFκB pathway

Molecular Oncology, EarlyView.
Cytoplasmic p21 promotes colorectal cancer stem cell (CSC) features by destabilizing the NFκB–IκB complex, activating NFκB signaling, and upregulating BCL‐xL and COX2. In contrast to nuclear p21, cytoplasmic p21 enhances spheroid formation and stemness transcription factor CD133.
Arnatchai Maiuthed, Kerstin Huebner, Katharina Erlenbach‐Wuensch, Chuanpit Hampel, Daniela Thalheim, Adriana Vial‐Roehe, Bodee Nutho, Susanne Merkel, Arndt Hartmann, Pithi Chanvorachote, Regine Schneider‐Stock   +10 more
wiley   +1 more source

SAT-Based Optimization Framework for Electric Vehicle Charging Station Routing Under Real-World Constraints

World Electric Vehicle Journal
With the rapid adoption of electric vehicles (EVs), optimizing charging infrastructure and route planning has become increasingly crucial. Traditional methods such as Linear Programming (LP) have been widely used to address these challenges.
Shiva Sai Rama Krishna Ravipati, Srinivasa Rao Jalluri, Srikanth Kunta   +2 more
doaj   +1 more source

Class IIa HDACs forced degradation allows resensitization of oxaliplatin‐resistant FBXW7‐mutated colorectal cancer

Molecular Oncology, EarlyView.
HDAC4 is degraded by the E3 ligase FBXW7. In colorectal cancer, FBXW7 mutations prevent HDAC4 degradation, leading to oxaliplatin resistance. Forced degradation of HDAC4 using a PROTAC compound restores drug sensitivity by resetting the super‐enhancer landscape, reprogramming the epigenetic state of FBXW7‐mutated cells to resemble oxaliplatin ...
Vanessa Tolotto, Nicolò Gualandi, Ylenia Cortolezzis, Raffaella Picco, Monica Colitti, Francesca D'Este, Mariachiara Gani, Wayne W. Hancock, Giovanni Terrosu, Cristina Degrassi, Francesca Agostini, Claudio Brancolini, Luigi E. Xodo, Eros Di Giorgio   +13 more
wiley   +1 more source

Optimization of Boolean satisfiability solver by caching intermediate results

Труды Института системного программирования РАН, 2018
Recently, a number of dynamic analysis tools were developed that perform tainted data flow tracing and use algorithms for solving the CNF SAT problem for input data generation and path alteration.
S. Vartanov, D. Sidorov
doaj  

Explanations for SAT Solvers

, 2023
Les solveurs SAT sont devenus des outils largement utilisés pour résoudre des problèmes de décision ou d’optimisation combinatoires, dans le monde académique comme dans le monde économique. L’une des raisons de leur succès est de parcourir efficacement l’espace de recherche, que l’on peut représenter sous la forme d’un arbre.
openaire   +1 more source

Molecular characterisation of human penile carcinoma and generation of paired epithelial primary cell lines

Molecular Oncology, EarlyView.
Generation of two normal and tumour (cancerous) paired human cell lines using an established tissue culture technique and their characterisation is described. Cell lines were characterised at cellular, protein, chromosome and gene expression levels and for HPV status.
Simon Broad, Mahmood Hachim, Tom Bertin, Karolina Penderecka, Rifat Hamoudi, Saif Khan, Rui Henrique, Natalie Bergmoser, Manit Arya, Kalle Sipila, Matteo Vietri Rudan, Asif Muneer, Aamir Ahmed   +12 more
wiley   +1 more source

Instance Assignment Coverage Feature for Operation Control of SAT Solver

International Journal of Computational Intelligence Systems
The Conflict-Driven Clause Learning (CDCL) framework integrates multiple heuristic components to solve Boolean satisfiability (SAT) problems through synergistic cooperation.
Zhihui Li, Shuwei Chen, Guanfeng Wu, Yang Xu   +3 more
doaj   +1 more source

Automatic method for searching impossible differentials and zero-correlation linear hulls of ARX block ciphers

网络与信息安全学报, 2017
Firstly,the differences and linear masks propagation equations of ARX ciphers were established.Secondly,the propagation equations were solved by SAT solver and judged valid or not.Finally,differences and linear masks were traversed to search impossible ...
Ya HAN
doaj   +1 more source

preSAT: SAT Solver Description

, 2008
This document briefly describes preSAT 1.0 , a new technique designed to efficiently solve structured CNF formulae.
Piette, Cédric, Hamadi, Youssef, Saïs, Lakhdar   +2 more
openaire   +1 more source