Results 31 to 40 of about 4,919,639 (299)
Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem
Applications of Modelling and Simulation, 2023 The evolutionary algorithm has been extensively used to solve a range of combinatorial optimization problems. The adaptability of evolutionary algorithm mechanisms provides diverse approaches to handle combinatorial optimization challenges.
Anniza Hamdan +4 more
doaj
Discrete Mathematics, 1993 There are many interesting and sophisticated problems raised in the IMO, Putnam and other olympiads. Some of these problems have deep mathematical background, nice generalizations, and lead to new areas of research in combinatorics. In this paper several topics in this category (disjoint simplices, alternating simple path problems, balanced colorings, \
Jin Akiyama +2 more
openaire +3 more sources
Combinatorial Problems on H-graphs [PDF]
Electronic Notes in Discrete Mathematics, 2017 Biró, Hujter, and Tuza introduced the concept of $H$-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a graph $H$. They naturally generalize many important classes of graphs, e.g., interval graphs and circular-arc graphs. We continue the study of these graph classes by considering coloring, clique, and isomorphism problems ...
Steven Chaplick, Peter Zeman 0001
openaire +4 more sources
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
Quantum computational phase transition in combinatorial problems
npj Quantum Information, 2022 Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers.
Bingzhi Zhang, Akira Sone, Quntao Zhuang
doaj +1 more source
Combinatorial ink-jet printing for ceramic discovery [PDF]
, 2006 PhDAn aspirating and dispensing printer established inside a robot gantry equipped with furnace and measurement table is used to prepare thick-film combinatorial libraries.
Wang, Jian
core +4 more sources
Combinatorial reconstruction problems
Journal of Combinatorial Theory, Series B, 1989 A general technique for tackling reconstruction problems is presented and applied to some old and some new instances of such problems. In particular it is shown that every polygon wih \(m>8\) vertices in the plane is determined, up to isometry, by the set of isometry types of its vertex deleted subpolygons.
Noga Alon +3 more
openaire +1 more source
Discrete Mathematics, 2001 A \(T\)-partition of \([n]=\{1, \dots, n\}\), \(n\geq 2\), is a 2-partition \(\{X,Y\}\) where, for every \(k\in\{1, \dots, n-1\}\), there exist \(i\in X\), \(j\in Y\), such that \(|i-j|=k\). The author here addresses the problem of counting the number of elements in \(T_n\), the set of \(T\)-partitions of \([n]\), and checking the asymptotic behavior ...
openaire +2 more sources
On a problem in combinatorial geometry
Discrete Mathematics, 1982 Let \(f(S)\) be the ratio of the area of a largest (nondegenerate) triangle determined by the points of a finite set \(S\) to that of a smallest, and \(f(n)=\inf_sf(S)\), where the infimum is taken over all planar, noncollinear sets \(S\) of cardinality \(n\).
Paul Erdös +2 more
openaire +3 more sources
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