Results 51 to 60 of about 1,714,979 (285)
Satisfiability-Based Algorithms for Boolean Optimization
, 2004 This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Computer Science and Engineering.
Manquinho, V., Marques-Silva, J. P.
core +2 more sources
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
International Journal of Industrial Engineering and Production Research, 2018 Supplying of blood and blood products is one of the most challenging issues in the healthcare system since blood is as extremely perishable and vital good and donation of blood is a voluntary work.
Mahdi Bashiri, Elaheh Ghasemi
doaj
Modeling and solving the dynamic modular capacitated maximal covering location problem [PDF]
مدیریت تولید و عملیات, 2018 Maximal covering location problem is one of the most important network location problems that is used in various applications. To improve the application of the maximal covering location problem (MCLP), several capacitated MCLP models were proposed ...
Jafar Bagherinejad +2 more
doaj +1 more source
The analysis of algorithm for transmitters locating problem
Lietuvos Matematikos Rinkinys, 2023 The analysis of ACO algorithm for transmitters locating problem is presented in this paper.
Saulius Lazaravičius +1 more
doaj +1 more source
Aging and Cancer, EarlyView.This study underscores the significant influence of frailty and vitality on the subjective health experience of older cancer survivors with acceptance and control emerging as salient mediators. These findings affirm the conceptual and empirical robustness of the model highlighting its potential utility in shaping future interventions for older cancer ...
Damien S. E. Broekharst +4 more
wiley +1 more source
A method for bi-decomposition of partial Boolean functions
Informatika, 2019 The problem of bi-decomposition of a Boolean function is to represent a given Boolean function in the form of a given logic algebra operation over two Boolean functions and so is reduced to specification of these functions.
Yu. V. Pottosin
doaj
AxiomsIn Chuanming Zong’s program to attack Hadwiger’s covering conjecture, which is a longstanding open problem from Convex and Discrete Geometry, it is essential to estimate covering functionals of convex bodies effectively. Recently, He et al. and Yu et al.
Xiangyang Han, Senlin Wu, Longzhen Zhang
doaj +1 more source
A column generation approach to the airline crew pairing problem to minimize the total person-days
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2016 In this paper, we consider the crew pairing problem in airline scheduling that calls for assigning crew members in order to cover all flights with the minimum total person-days under the constraints that the schedule of each crew member does not violate ...
Wei WU +5 more
doaj +1 more source