Results 51 to 60 of about 20,200 (225)
Colored Multi-Agent Path Finding: Solving Approaches
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2021 Multi-Agent Path Finding (MAPF) deals with the problem of finding collision-free paths for a set of agents moving in a shared environment while each agent has specified its destination.
Roman Barták +2 more
doaj +1 more source
Percolation of satisfiability in finite dimensions [PDF]
, 2003 The satisfiability and optimization of finite-dimensional Boolean formulas are studied using percolation theory, rare region arguments, and boundary effects.
A. Alan Middleton +9 more
core +3 more sources
Computing discrete logarithm by interval-valued paradigm [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Interval-valued computing is a relatively new computing paradigm. It uses finitely many interval segments over the unit interval in a computation as data structure.
Benedek Nagy, Sándor Vályi
doaj +1 more source
Boolean Satisfiability in Electronic Design Automation [PDF]
, 2000 Boolean Satisfiability (SAT) is often used as the underlying model for a significant and increasing number of applications in Electronic Design Automation (EDA) as well as in many other fields of Computer Science and Engineering. In recent years, new and
Marques-Silva, J. P., Sakallah, K. A.
core +3 more sources
Predicting Propositional Satisfiability Based on Graph Attention Networks
International Journal of Computational Intelligence Systems, 2022 Boolean satisfiability problems (SAT) have very rich generic and domain-specific structures. How to capture these structural features in the embedding space and feed them to deep learning models is an important factor influencing the use of neural ...
Wenjing Chang, Hengkai Zhang, Junwei Luo
doaj +1 more source
Combining solutions of the optimum satisfiability problem using evolutionary tunneling
Mendel, 2020 The optimum satisfiability problem involves determining values for Boolean variables to satisfy a Boolean expression, while maximizing the sum of coefficients associated with the variables chosen to be true.
Rodrigo Ferreira da Silva +2 more
doaj +1 more source
Control of Cellular Differentiation Trajectories for Cancer Reversion. [PDF]
Adv Sci (Weinh)A computational framework, single‐cell Boolean network inference and control (BENEIN), is presented. Applying BENEIN to human large intestinal single‐cell transcriptome, MYB, HDAC2, and FOXA2 are identified as the master regulators whose inhibition induces enterocyte differentiation.
Gong JR +6 more
europepmc +2 more sources
MAX-SAT Problem using Hybrid Harmony Search Algorithm
Journal of Intelligent Systems, 2018 Maximum Satisfiability problem is an optimization variant of the Satisfiability problem (SAT) denoted as MAX-SAT. The aim of this problem is to find Boolean variable assignment that maximizes the number of satisfied clauses in the Boolean formula.
Abu Doush Iyad +3 more
doaj +1 more source
DETERMINISTIC FINITE AUTOMATA LEARNING USING COUNTEREXAMPLE GUIDED ABSTRACTION REFINEMENT [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 Subject of Research. The paper studies minimum-sized deterministic finite automata inferring problem. A hybrid method is developed and implemented reducing the given problem to Boolean satisfiability (SAT) technique and at the same time applying a ...
Ilya T. Zakirzyanov
doaj +1 more source
, 2018 We present an exact synthesis approach for computing Exclusive-or Sum-of-Products (ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our approach finds one or more ESOP forms for a given Boolean function.
De Micheli, Giovanni +3 more
core +1 more source