Search Results

Conditional preference networks (CP-nets) have received significant attention for modeling preferences over combinations of features. However, dominance testing, the problem of inferring from a CP-net whether one outcome is always preferred over ...

Group recommenders aim to provide recommendations that satisfy the collective preferences of multiple users, a challenging task due to the diverse individual tastes and conflicting interests to be balanced. This is often accomplished by using aggregation ...

In this article, we consider a network of quantum sensors, where each sensor is a qubit detector that “fires,” i.e., its state changes when an event occurs close by. The change in state due to the firing of a detector is given by a unitary operator, which ...

We study symmetry-breaking enhancements for Continuous-Time Conflict-Based Search (CCBS), a solver for continuous-time MAPF. Resolving conflict symmetries in MAPF can require an exponential amount of work. We adapt known symmetry-breaking enhancements ...

Wildfires cause significant damage costs globally, and it is likely that they are becoming more damaging due to climate change. Here we study methods for fire suppression, after a breakout of fire. In our model, we have a grid graph $G=(V,A)$ that ...$$$$

This article considers the problem of planning a complex of nonconflicting paths for a set of agents that are capable of performing actions of arbitrary duration. Two bounded-suboptimal modifications of a conflict-based search algorithm are ...

This study considers a well-known critical node detection problem that aims to minimize a pairwise connectivity measure of an undirected graph via the removal of a subset of nodes (referred to as critical nodes) subject to a cardinality constraint. ...

The uniform capacitated vertex k-center problem is an 𝒩𝒫-hard combinatorial optimization problem that models real situations where k centers can only attend a maximum number of customers, and the travel time or distance from the customers to their ...

Query-by-Example spoken content retrieval is a demanding and challenging task when a large volume of spoken content is piled up in the repositories without annotation. In the absence of annotation, spoken content retrieval is achieved by capturing the ...

In the Watchman Route Problem (WRP), the task is to find a path for a watchman agent such that all locations in the given map will be visually seen by the watchman at least once during the path traversal. Recently, the problem has been optimally solved ...

The research and development of deep learning cannot be separated from deep neural networks (DNNs). DNNs become deeper and more complex in pursuit of accuracy and precision, leading to significantly increasing inference time and training cost. Existing ...

Resource allocation systems (RASs) belong to a kind of discrete event system commonly seen in the industry. In such systems, available resources are allocated to concurrently running processes to optimize some performance criteria. Search strategies in ...

Hand-crafting accurate heuristics for optimization problems is often costly due to requiring expert knowledge and time-consuming parameter tuning. Automating this procedure using machine learning has in recent years shown great promise. However, a large ...

The problem of scheduling Directed Acyclic Graphs (DAGs) in order to minimize schedule length (also known as makespan), is known to be a challenging as well as computationally hard problem. Therefore, researchers have endeavored towards the design of ...

Weapon-target assignment (WTA) is a well-studied problem in operations research, with a wide range of applications in simple task assignments. However, in situations involving complex task scheduling, WTA fails to capture many important planning ...

The problem of scheduling Directed Acyclic Graphs in order to minimize makespan (schedule length), is known to be a challenging and computationally hard problem. Therefore, researchers have endeavored towards the design of various heuristic solution ...

This paper studies the use of Electric Vehicles (EVs) in a Mobility-on-Demand (MoD) scheme. In this scheme, customers that act as cooperative agents request a set of alternative trips, where each trip provides a utility to the agent. The EVs are ...$\mathrm{}$$\mathrm{}$$\mathrm{}$

Multi-Agent Path Finding (MAPF) is an NP-hard problem that has important applications for distribution centers, traffic management and computer games, and it is still difficult for current solvers to solve large instances optimally. Bounded suboptimal ...

Path planning in robotics often requires finding high-quality solutions to continuously valued and/or high-dimensional problems. These problems are challenging and most planning algorithms instead solve simplified approximations. Popular approximations ...

This paper presents a medical brain image algorithm based on multi-feature fusion. Feature extraction based on convolutional neural network was used as texture information, feature extraction based on voxel information was used as morphological feature, ...