Search · four archives
Search · four archives
13 papers · ranked by Valyu relevance
Vahid Beiranvand, Warren Hare, Yves Lucet
Comparing, or benchmarking, of optimization algorithms is a complicated task that involves many subtle considerations to yield a fair and unbiased evaluation. In this paper, we systematically review the benchmarking process of optimization algorithms, and discuss the challenges of fair comparison. We provide…
Thomas Bartz–Beielstein, Carola Doerr, Jakob Bossek, Sowmya Chandrasekaran + 11 more
'Sowmya Chandrasekaran' 'Tome Eftimov' 'Andreas Fischbach' 'Pascal Kerschke' 'Manuel López‐Ibáñez' 'Katherine M. Malan' 'Jason H. Moore' 'Boris Naujoks' 'Patryk Orzechowski' 'Vanessa Volz' 'Markus Wagner' 'Thomas Weise'] Thomas Bartz-Beielstein1 , Carola Doerr2 , Daan van den Berg3 , Jakob Bossek6 , Sowmya…
Anu Bajaj, Ajith Abraham, Saroj Ratnoo, Lubna Abdelkareim Gabralla + 1 more
The emerging areas of IoT and sensor networks bring lots of software applications on a daily basis. To keep up with the ever-changing expectations of clients and the competitive market, the software must be updated. The changes may cause unintended consequences, necessitating retesting, i.e., regression testing, before…
Jan Mendling, Henrik Leopold, Henning Meyerhenke, Benoît Depaire
Research on algorithms has drastically increased in recent years. Various sub-disciplines of computer science investigate algorithms according to different objectives and standards. This plurality of the field has led to various methodological advances that have not yet been transferred to neighboring sub-disciplines.…
Aravind Sankaran, Paolo Bientinesi
—In scientific computing, it is common that a mathematical expression can be computed by many different algorithms (sometimes over hundreds), each identifying a specific sequence of library calls. Although mathematically equivalent, those algorithms might exhibit significant differences in terms of performance. However…
Christian Baudet, Zanoni Dias, Marie-France Sagot
Background Traditional algorithms to solve the problem of sorting by signed reversals output just one optimal solution while the space of all optimal solutions can be huge. A so-called trace represents a group of solutions which share the same set of reversals that must be applied to sort the original permutation…
Etor Arza, Josu Ceberio, Ekhiñe Irurozki, Aritz Pérez
An experimental comparison of two or more optimization algorithms requires the same computational resources to be assigned to each algorithm. When a maximum runtime is set as the stopping criterion, all algorithms need to be executed in the same machine if they are to use the same resources. Unfortunately, the…
Aravind Sankaran, Paolo Bientinesi
—Linear algebra expressions, which play a central role in countless scientific computations, are often computed via a sequence of calls to existing libraries of building blocks (such as those provided by BLAS and LAPACK). A sequence identifies a computing strategy, i.e., an algorithm, and normally for one linear…
Christoph Laaber, Harald C. Gall, Philipp Leitner
Regression testing comprises techniques which are applied during software evolution to uncover faults effectively and efficiently. While regression testing is widely studied for functional tests, performance regression testing, e.g., with software microbenchmarks, is hardly investigated. Applying test case…
Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris, Mohd Nadhir Ab Wahab
'Mohd Nadhir Ab Wahab'] Path testing is the basic approach of white box testing and the main approach to solve it by discovering the particular input data of the searching space to encompass the paths in the software under test. Due to the increasing software complexity, exhaustive testing is impossible and…
Donald S. Ene, V.I.E Anireh
- Evaluating how well a whole system or set of subsystems performs is one of the primary objectives of performance testing. We can tell via performance assessment if the architecture implementation meets the design objectives. Performance evaluations of several parallel algorithms are compared in this study. Both…
Nnaemeka C. Iriemenam, Augustine Mpamugo, Akudo Ikpeazu, Olumide O. Okunoye + 28 more
'Olumide O. Okunoye' 'Edewede Onokevbagbe' 'Orji O. Bassey' 'Jelpe Tapdiyel' 'Matthias A. Alagi' 'Chidozie Meribe' 'Mukhtar L. Ahmed' 'Gabriel Ikwulono' 'Rose Aguolu' 'Gregory Ashefor' 'Charles Nzelu' 'Akipu Ehoche' 'Babatunde Ezra' 'Christine Obioha' 'Ibrahim Baffa Sule' 'Oluwasanmi Adedokun' 'Nwando Mba' 'Chikwe…
Bader Alkhazi, Amin Alipour, Wenbing Zhao
The ability to create decentralized applications without the authority of a single entity has attracted numerous developers to build applications using blockchain technology. However, ensuring the correctness of such applications poses significant challenges, as it can result in financial losses or, even worse, a loss…