Classifying C++ Solutions Based on Their Energy Profile

The algorithm classification problem consists of finding which algorithm a program implements among a given finite set of algorithms. We propose a novel classification strategy using the power slope that best represents an algorithm energy consumption profile. Thenwe classify a set of solutions by using a greedy approach to match two sets of solutions that are aimed to solve the same problem. To evaluate our approach, we used sets of random C++ solutions for 32 problems from CSES, a programming competition site. We executed two datasets twice in two different machines. In one machine, we restricted the classification task to a subset that varies from 14 to 16 CSES problems (a reduction of at least 50% in the search space). In the other one, we could reach a reduction in the search space that varied from 38% up to 53%.

Authors

Publication Details

Published
2024-09-30
DOI
https://doi.org/10.5753/sblp.2024.3693
Citations
1
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Classifying C++ Solutions Based on Their Energy Profile

Sérgio Queiróz de Medeiros, Marcelo B. Nogueira
1 citations
Parallel Computing and Optimization Techniques
0.49
article

Classifying C++ Solutions Based on Their Energy Profile

Sérgio Queiróz de Medeiros, Marcelo B. Nogueira
article en
1 citations

Abstract

The algorithm classification problem consists of finding which algorithm a program implements among a given finite set of algorithms. We propose a novel classification strategy using the power slope that best represents an algorithm energy consumption profile. Thenwe classify a set of solutions by using a greedy approach to match two sets of solutions that are aimed to solve the same problem. To evaluate our approach, we used sets of random C++ solutions for 32 problems from CSES, a programming competition site. We executed two datasets twice in two different machines. In one machine, we restricted the classification task to a subset that varies from 14 to 16 CSES problems (a reduction of at least 50% in the search space). In the other one, we could reach a reduction in the search space that varied from 38% up to 53%.

Openalex Percentile: Top 36%
Parallel Computing and Optimization Techniques
0.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.