Buscar
Mostrando ítems 1-10 de 21808
The Complexity of Counting Problems Over Incomplete Databases
(ASSOC COMPUTING MACHINERY, 2021)
We study the complexity of various fundamental counting problems that arise in the context of incomplete databases, i.e., relational databases that can contain unknown values in the form of labeled nulls. Specifically, we ...
Cogeneration design problem Computational complexity analysis and solution through an expert system
(Emerald Group Publishing Limited, 2014-01-01)
Purpose - The purpose of this paper is twofold: to analyze the computational complexity of the cogeneration design problem; to present an expert system to solve the proposed problem, comparing such an approach with the ...
A binary fruit fly optimization algorithm to solve the set covering problem
(Springer Verlag, 2015)
Descriptive Complexity for counting complexity classes
(IEEE, 2017)
Descriptive Complexity has been very successful in characterizing complexity classes of decision problems in terms of the properties definable in some logics. However, descriptive complexity for counting complexity classes, ...
Combinatorial Flexibility problems and their computational Complexity
(Elsevier, 2008-02)
The concept of flexibility-originated in the context of heat exchanger networks-is associated with a substructure which guarantees the performance of the original structure, in a given range of possible states. We extend ...
Cat swarm optimization with different binarization methods for solving set covering problems
(Springer Verlag, 2016)
Solving the set covering problem with the soccer league competition algorithm
(Springer Verlag, 2016)
Cogeneration design problem Computational complexity analysis and solution through an expert system
(Emerald Group Publishing Limited, 2015)
Cogeneration design problem Computational complexity analysis and solution through an expert system
(Emerald Group Publishing Limited, 2015)