Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Weapon target assignment problem

Publications associées (12)

Perturbed Utility Stochastic Traffic Assignment

Rui Yao

This paper develops a fast algorithm for computing the equilibrium assignment with the perturbed utility route choice (PURC) model. Without compromise, this allows the significant advantages of the PURC model to be used in large-scale applications. We form ...

Informs2024

A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem

Tony Alan Wood

We develop an algorithm to solve the bottleneck assignment problem (BAP) that is amenable to having computation distributed over a network of agents. This consists of exploring how each component of the algorithm can be distributed, with a focus on one com ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Maryam Kamgarpour, Tony Alan Wood

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

2023

Scalable Semidefinite Programming

Volkan Cevher, Alp Yurtsever

Semidefinite programming (SDP) is a powerful framework from convex optimization that has striking potential for data science applications. This paper develops a provably correct algorithm for solving large SDP problems by economizing on both the storage an ...

2021

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems

Boi Faltings, Panayiotis Danassis

The next technological revolution will be interwoven to the proliferation of intelligent systems. As we bridge the gap between physical and cyber worlds, we will give rise to large-scale, multi-agent based technologies. A key challenge that cities of the f ...

IOS PRESS2020

Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior

Boi Faltings, Aris Filos Ratsikas, Panayiotis Danassis

We present a novel anytime heuristic (ALMA), inspired by the human principle of altruism, for solving the assignment problem. ALMA is decentralized, completely uncoupled, and requires no communication between the participants. We prove an upper bound on th ...

2019

Integration of passenger satisfaction in railway timetable rescheduling for major disruptions

Stefan Yves Gabriel Binder

Unexpected disruptions occur for many reasons in railway networks and cause delays, cancellations, and, eventually, passenger inconvenience. This thesis focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of lar ...

EPFL2018

Exact Convex Modeling of the Optimal Power Flow for the Operation and Planning of Active Distribution Networks with Energy Storage Systems

Mostafa Nick

The distribution networks are experiencing important changes driven by the massive integration of renewable energy conversion systems. However, the lack of direct controllability of the Distributed Generations (DGs) supplying Active Distribution Networks ( ...

EPFL2016

Challenges in Algorithmic Mechanism Design

Paul David Dütting

This thesis addresses three challenges in algorithmic mechanism design, which seeks to devise computationally efficient mechanisms consisting of an outcome rule and a payment rule that implement desirable outcomes in strategic equilibrium. The first challe ...

EPFL2013

A real-time multi-aperture omnidirectional visual sensor with interconnected network of smart cameras

Hossein Afshari

A novel omnidirectional visual sensor called the Panoptic camera is introduced. The Panoptic camera is an omnidirectional multi-aperture visual system which is realized by mounting multiple camera sensors on a hemispherical frame. The introduced visual sen ...

EPFL2013

Ensuring Privacy through Distributed Computation in Multiple-Depot Vehicle Routing Problems

Boi Faltings, Thomas Léauté, Brammert Ottens

The Vehicle Routing Problem (VRP) has been extensively studied over the last twenty years, because it is an abstraction of many real-life logistics problems. In its multiple-depot variant (MDVRP), the routes of vehicles located at various depots must be op ...

2010

Optimal Channel Choice for Collaborative Ad-Hoc Dissemination

Jean-Yves Le Boudec, Milan Vojnovic

Collaborative ad-hoc dissemination of information has been proposed as an efficient means to disseminate information among devices in a wireless ad-hoc network. Devices help in forwarding the information channels to the entire network, by disseminating the ...

2010