Results 101 to 110 of about 246,520 (298)

FYalSAT: High-Throughput Stochastic Local Search K-SAT Solver on FPGA

IEEE Access
The satisfiability (SAT) problem is a fundamental challenge in computing and has a broad range of applications. This problem is NP-complete, and many algorithmic and architectural improvements have aimed at accelerating the SAT solver.
Young-Kyu Choi, Changsoo Kim
doaj   +1 more source

A SAT-based Sudoku solver

, 2005
. This paper presents a SAT-based Sudoku solver. A Sudoku is translated into a propositional formula that is satisfiable if and only if the Sudoku has a solution.
Tjark Weber
core  

Optimization based on timed Petri nets using CP-SAT - an integrated SAT and CP solver

A simple but general semantics for timed Petri nets is presented in this paper. Based on this semantics, an optimization formulation is introduced and implemented in a recently developed optimization solver, where a satisfiability (SAT) solver is ...
Bengt Lennartson, Lennartson, Bengt,
core   +1 more source

SPHINX31 acts as a SRPK1 inhibitor targeting the ATR/DNA‐PKcs/CHK1 replicative checkpoint to inhibit cell growth in non‐small cell lung cancer

Molecular Oncology, EarlyView.
The kinase SRPK1 directly interacts with the protein TOPBP1 and regulates the pre‐mRNA splicing of WIZ thereby contributing to the activation of the ATR/CHK1 replicative checkpoint in response to replicative stress. This allows cancer cells' genomic stability and survival.
Amani Shreim, Aurelie Genoux, Nadiia Zubchuk, Haoyang Zheng, Perla Salameh, Theo Ziegelmeyer, Fabien Dalonneau, Margot Rouchette, Christiane Oddou, Simona Miron, Helene Polveche, Adiilah Mamode Cassim, Carmen Garrido, Eleni Nikolakaki, Didier Auboeuf, Tao Jia, Sophie Zinn‐Justin, Beatrice Eymin   +17 more
wiley   +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

Mutant p53R273H disrupts PDPK1 homodimerization and contributes to PDPK1 activation

Molecular Oncology, EarlyView.
How mutant p53R273H drives AKT signaling is unclear. We show that p53R273H, but not wild‐type, directly binds PDPK1 via a mutation‐dependent conformational change. This interaction disrupts inhibitory PDPK1 homodimerization and enhances AKT phosphorylation.
Mei Chee Lim, Alvin Kunyao Guo, Yoko Itahana, Srinivasaraghavan Kannan, Valerie Goh, Mingmin Ong, Terina Yan Wen Tay, Weiying Ye, Sabhashina Radha Krishnan, Jun Nishiyama, Chandra S Verma, Koji Itahana   +11 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

Targeting the EpCAM‐AXL axis to overcome drug resistance in lung cancer

Molecular Oncology, EarlyView.
Lung cancer cells often evade therapy by hijacking signaling pathways. We reveal that cleaved EpCAM (sEpCAM) stabilizes the oncogenic protein AXL, driving NF‐κB and STAT3‐mediated chemoresistance. This EpCAM‐AXL axis identifies a high‐risk patient subset with poor prognosis.
Alexa Guerrero‐Alba, Mark Shacker, Timothy P. Fleming, Michael A. Smith, Ross M. Bremner, Narendra V. Sankpal   +5 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

Heuristic Backtracking Algorithms for SAT

, 2003
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of formal verification, and also motivated the development of many new ...
Bhalla, A., Marques-Silva, J., J.T. de Sousa, J. Marques-Silva, Sousa, J., Lynce, I., A. Bhalla, I. Lynce   +7 more
core