English
Related papers

Related papers: Heuristic Methods and Performance Bounds for Photo…

200 papers

Selecting the best code solution from multiple generated ones is an essential task in code generation, which can be achieved by using some reliable validators (e.g., developer-written test cases) for assistance. Since reliable test cases…

Software Engineering · Computer Science 2024-10-22 Mouxiang Chen , Zhongxin Liu , He Tao , Yusu Hong , David Lo , Xin Xia , Jianling Sun

Design under uncertainty is a challenging problem, as a systems performance can be highly sensitive to variations in input parameters and model uncertainty. A conventional approach to addressing such problems is robust optimization, which…

Systems and Control · Electrical Eng. & Systems 2025-09-18 Maryam Ghasemzadeh , H M Dilshad Alam Digonta , Anand Balu Nellippallil , Anton van Beek

In this paper, we describe the hyper-parameter search problem in the field of machine learning and present a heuristic approach in an attempt to tackle it. In most learning algorithms, a set of hyper-parameters must be determined before…

Machine Learning · Computer Science 2020-01-14 Wei Hao Khoong

A key challenge in satisficing planning is to use multiple heuristics within one heuristic search. An aggregation of multiple heuristic estimates, for example by taking the maximum, has the disadvantage that bad estimates of a single…

Artificial Intelligence · Computer Science 2021-04-13 David Speck , André Biedenkapp , Frank Hutter , Robert Mattmüller , Marius Lindauer

In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can…

Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…

Metric Geometry · Mathematics 2015-09-28 P. G. Boyvalenkov , P. D. Dragnev , D. P. Hardin , E. B. Saff , M. M. Stoyanova

Over the past decade alternative technologies have gained momentum as conventional digital electronics continue to approach their limitations, due to the end of Moore's Law and Dennard Scaling. At the same time, we are facing new…

Emerging Technologies · Computer Science 2020-06-16 Armin Mehrabian , Volker J. Sorger , Tarek El-Ghazawi

In mechanical design, there is often unavoidable uncertainty in estimates of design performance. Evaluation of design alternatives requires consideration of the impact of this uncertainty. Expert heuristics embody assumptions regarding the…

Artificial Intelligence · Computer Science 2013-03-26 Deborah L. Thurston , Yun Qi Tian

Optimisation algorithms are commonly compared on benchmarks to get insight into performance differences. However, it is not clear how closely benchmarks match the properties of real-world problems because these properties are largely…

Neural and Evolutionary Computing · Computer Science 2021-07-15 Koen van der Blom , Timo M. Deist , Vanessa Volz , Mariapia Marchi , Yusuke Nojima , Boris Naujoks , Akira Oyama , Tea Tušar

This paper presents a non-manual design engineering method based on heuristic search algorithm to search for candidate agents in the solution space which formed by artificial intelligence agents modeled on the base of bionics.Compared with…

Artificial Intelligence · Computer Science 2018-07-30 Zengkun Li

Computational Design approaches facilitate the generation of typographic design, but evaluating these designs remains a challenging task. In this paper, we propose a set of heuristic metrics for typographic design evaluation, focusing on…

Multimedia · Computer Science 2024-02-13 Sérgio M. Rebelo , J. J. Merelo , João Bicker , Penousal Machado

The crossing resolution of a non-planar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. Recent experiments have shown that the larger the crossing resolution is, the easier it is to read and…

Data Structures and Algorithms · Computer Science 2018-09-03 Michael A. Bekos , Henry Förster , Christian Geckeler , Lukas Holländer , Michael Kaufmann , Amadäus M. Spallek , Jan Splett

Cutting plane methods, particularly outer approximation, are a well-established approach for solving nonlinear discrete optimization problems without relaxing the integrality of decision variables. While powerful in theory, their…

Optimization and Control · Mathematics 2025-11-04 Hòa T. Bùi , Alberto De Marchi

Target coverage problem in wireless sensor networks is concerned with maximizing the lifetime of the network while continuously monitoring a set of targets. A sensor covers targets which are within the sensing range. For a set of sensors…

Networking and Internet Architecture · Computer Science 2011-03-25 Manju , Arun K. Pujari

Photonic device development (PDD) has achieved remarkable success in designing and implementing new devices for controlling light across various wavelengths, scales, and applications, including telecommunications, imaging, sensing, and…

We present the first nontrivial procedure for configuring heuristic algorithms to maximize the utility provided to their end users while also offering theoretical guarantees about performance. Existing procedures seek configurations that…

Artificial Intelligence · Computer Science 2023-11-01 Devon R. Graham , Kevin Leyton-Brown , Tim Roughgarden

Combinatorial optimization is widely applied in a number of areas nowadays. Unfortunately, many combinatorial optimization problems are NP-hard which usually means that they are unsolvable in practice. However, it is often unnecessary to…

Data Structures and Algorithms · Computer Science 2012-07-10 Daniel Karapetyan

The increasing recognition of the association between adverse human health conditions and many environmental substances as well as processes has led to the need to monitor them. An important problem that arises in environmental statistics…

Applications · Statistics 2020-02-05 Yu Wang , Nhu D. Le , James V. Zidek

Automated planning remains one of the most general paradigms in Artificial Intelligence, providing means of solving problems coming from a wide variety of domains. One of the key factors restricting the applicability of planning is its…

Artificial Intelligence · Computer Science 2017-07-24 Pawel Gomoluch , Dalal Alrajeh , Alessandra Russo , Antonio Bucchiarone

In today's day and time solving real-world complex problems has become fundamentally vital and critical task. Many of these are combinatorial problems, where optimal solutions are sought rather than exact solutions. Traditional optimization…

Neural and Evolutionary Computing · Computer Science 2024-09-05 Pravin S Game , Vinod Vaze , Emmanuel M