Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1912.11533

Estudo comparativo de meta-heurísticas para problemas de colorações de grafos

Flávio José Mendes Coelho
View original source ↗Read source document ↗Export metadata ↓

Abstract

A classic graph coloring problem is to assign colors to vertices of any graph so that distinct colors are assigned to adjacent vertices. Optimal graph coloring colors a graph with a minimum number of colors, which is its chromatic number. Finding out the chromatic number is a combinatorial optimization problem proven to be computationally intractable, which implies that no algorithm that computes large instances of the problem in a reasonable time is known. For this reason, approximate methods and metaheuristics form a set of techniques that do not guarantee optimality but obtain good solutions in a reasonable time. This paper reports a comparative study of the Hill-Climbing, Simulated Annealing, Tabu Search, and Iterated Local Search metaheuristics for the classic graph coloring problem considering its time efficiency for processing the DSJC125 and DSJC250 instances of the DIMACS benchmark.

Explore related subjects

cs.OHcs.AI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Flávio José Mendes Coelho. 2019-12-18. Estudo comparativo de meta-heurísticas para problemas de colorações de grafos. https://arxiv.org/abs/1912.11533

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bidirectional Temporal Dynamics Modeling for EEG-based Driving Fatigue Recognition

Driving fatigue is a major contributor to traffic accidents and poses a serious threat to road safety. Electroencephalography (EEG) provides a direct measurement of neural activity, yet EEG-based fatigue recognition is hindered by strong non-stationarity and asymmetric neural dynamics. To address these challenges, we propose DeltaGateNet, a novel framework that explicitly captures Bidirectional temporal dynamics for EEG-based driving fatigue recognition. Our key idea is to introduce a Bidirectional Delta module that decomposes first-order temporal differences into positive and negative components, enabling explicit modeling of asymmetric neural activation and suppression patterns. Furthermore, we design a Gated Temporal Convolution module to capture long-term temporal dependencies for each EEG channel using depthwise temporal convolutions and residual learning, preserving channel-wise specificity while enhancing temporal representation robustness. Extensive experiments conducted under both intra-subject and inter-subject evaluation settings on the public SEED-VIG and SADT driving fatigue datasets demonstrate that DeltaGateNet consistently outperforms existing methods. On SEED-VIG, DeltaGateNet achieves an intra-subject accuracy of 81.89% and an inter-subject accuracy of 55.55%. On the balanced SADT 2022 dataset, it attains intra-subject and inter-subject accuracies of 96.81% and 83.21%, respectively, while on the unbalanced SADT 2952 dataset, it achieves 96.84% intra-subject and 84.49% inter-subject accuracy. These results indicate that explicitly modeling Bidirectional temporal dynamics yields robust and generalizable performance under varying subject and class-distribution conditions.

cs.OH↗
arXiv2026

Fixing ill-formed UTF-16 strings with SIMD instructions

UTF-16 is a widely used Unicode encoding representing characters with one or two 16-bit code units. The format relies on surrogate pairs to encode characters beyond the Basic Multilingual Plane, requiring a high surrogate followed by a low surrogate. Ill-formed UTF-16 strings -- where surrogates are mismatched -- can arise from data corruption or improper encoding, posing security and reliability risks. Consequently, programming languages such as JavaScript include functions to fix ill-formed UTF-16 strings by replacing mismatched surrogates with the Unicode replacement character (U+FFFD). We propose using Single Instruction, Multiple Data (SIMD) instructions to handle multiple code units in parallel, enabling faster and more efficient execution. Our software is part of the Google JavaScript engine (V8) and thus part of several major Web browsers.

cs.OH↗
arXiv2026

MRSeqStudio: MRI Sequence Design and Simulation as a Service in a Free and Open-Source Web Platform

MRI sequence prototyping increasingly relies on graphical design environments and numerical simulators to accelerate development and validation. While several platforms support interactive sequence construction, fully web-based solutions that combine integrated phantom management, high-fidelity Bloch simulation, and scalable multi-user deployment remain limited. We present MRSeqStudio, a web-based platform for interactive MR sequence design and simulation. The tool adopts a block-based representation model with real-time visualization and native JSON/Pulseq export. Simulations are performed using the GPU-enabled Bloch simulator KomaMRI, which enables accurate modeling of arbitrary pulse sequences and phantoms within an installation-free architecture. The system separates front-end interaction from back-end simulation services to support concurrent multi-user access. Sequence validity was assessed by comparing GRE and bSSFP implementations against equivalent sequences designed in mtrk and gammaSTAR. The resulting images showed minimal absolute differences and high mean structural similarity indices (SSIM). Stress testing under burst-request conditions demonstrated stable performance with up to 100 concurrent users on a high-performance desktop deployment. A comparative workflow analysis with mtrk and gammaSTAR further examined differences in representation models, parameter propagation strategies, and integration levels across platforms, highlighting the relative strengths and limitations of each tool. Results indicate that MRSeqStudio provides a reliable and accessible environment for MR sequence prototyping, combining web-native deployment with Bloch-level simulation fidelity and integrated phantom visualization.

cs.OH↗