Results 21 to 30 of about 28,166 (165)
Building Geometry Generation Example Applying GPT Models
ArchitectureThe emergence of large language models (LLMs) has opened new avenues for integrating artificial intelligence into architectural design workflows. This paper explores the feasibility of applying generative AI to solve a classic combinatorial problem ...
Zsolt Ercsey, Tamás Storcz
doaj +1 more source
Educar em Revista, 2011 Neste trabalho apresentamos os dados de uma pesquisa que teve por objetivo verificar o desempenho de alunos do 6.° ao 9.° anos do Ensino Fundamental na resolução de oito problemas multiplicativos, envolvendo raciocínio combinatório. Os problemas diferiam
Leny R. M. Teixeira +3 more
doaj +1 more source
Solving Combinatorial Optimization Problems on Quantum Computers
Кібернетика та комп'ютерні технології, 2020 Introduction. Quantum computers provide several times faster solutions to several NP-hard combinatorial optimization problems in comparison with computing clusters.
Vyacheslav Korolyov +1 more
doaj +1 more source
A Combinatorial Assignment Problem [PDF]
Nature, 1961 IN an establishment, there are v= nk officers, r departments and k types of jobs in each department. Each officer has to be assigned a job in each department such that in any department there are equal numbers of officers in different jobs and any two officers have common jobs in exactly λ departments.
openaire +1 more source
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem [PDF]
Yugoslav Journal of Operations Research, 2011 Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets.
Pop Petrica, Pop-Sitar Corina
doaj +1 more source
Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development
Applied Sciences, 2021 In the past few decades, metaheuristics have demonstrated their suitability in addressing complex problems over different domains. This success drives the scientific community towards the definition of new and better-performing heuristics and results in ...
Fernando Peres, Mauro Castelli
doaj +1 more source
Combinatorial Estimations on Burnside Type Problems
MathematicsThe Burnside problem, formulated by W. Burnside in 1902, is one of the most well-known and important open questions in the field of Group Theory. Despite significant progress made in the past century towards solving this problem, its complete solution ...
Anton Beletskiy, Ilya Ivanov-Pogodaev
doaj +1 more source
On Large Sum-Free Sets: Revised Bounds and Patterns
MathematicsIn this paper, we rectify two previous results found in the literature. Our work leads to a new upper bound for the largest sum-free subset of [1,n] with the lowest value in n3,n2, and the identification of all patterns that can be used to form sum-free ...
Renato Cordeiro de Amorim
doaj +1 more source
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
IEEE Access, 2021 The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated.
Kensuke Tamura +4 more
doaj +1 more source
Bird Mating Optimizer for Combinatorial Optimization Problems
IEEE Access, 2020 The bird mating optimizer is a new metaheuristic algorithm that was originally proposed to solve continuous optimization problems with a very promising performance.
Anas Arram +3 more
doaj +1 more source