Search Results for author:
Found 10 papers, 1 papers with code
Large Language Models for the Automated Analysis of Optimization Algorithms
The ability of Large Language Models (LLMs) to generate high-quality text and code has fuelled their rise in popularity.
Saliency-Driven Hierarchical Learned Image Coding for Machines
Areas without saliency are transmitted in latent spaces of lower spatial resolution in order to reduce the bitrate.
An Efficient Merge Search Matheuristic for Maximising the Net Present Value of Project Schedules
This paper presents a novel matheuristic framework designed for resource constrained project scheduling, Merge search, which is a variable partitioning and merging mechanism to formulate restricted mixed integer programs with the aim of improving an existing pool of solutions.
Robust Deep Neural Object Detection and Segmentation for Automotive Driving Scenario with Compressed Image Data
Deep neural object detection or segmentation networks are commonly trained with pristine, uncompressed data.
Synergistic Team Composition: A Computational Approach to Foster Diversity in Teams
Thus, the goal of the STCP is to partition a set of individuals into a set of synergistic teams: teams that are diverse in personality and gender and whose members cover all required competencies to complete a task.
Generic CP-Supported CMSA for Binary Integer Linear Programs
Moreover, the results indicate that the support of the constraint propagation engine is useful in the context of problems for which finding feasible solutions is rather difficult.
A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem
The longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology.
Active exploration of sensor networks from a robotics perspective
Starting with the most basic task for mobile wireless network nodes, finding the position of another node, we introduce an algorithm able to solve this task.
Gradient-based Taxis Algorithms for Network Robotics
Finding the physical location of a specific network node is a prototypical task for navigation inside a wireless network.
Mathematical Programming Strategies for Solving the Minimum Common String Partition Problem
The minimum common string partition problem is an NP-hard combinatorial optimization problem with applications in computational biology.
