Abstract: This paper deals with the online fault diagnosis problem of discrete event systems under malicious external attacks. We consider a scenario where an attacker can intercept certain sensor ...

Abstract: In this paper, we present the Time-Dependent Vehicle Routing Problem with Fleet and Crew Assignment (TD-VRPFCA), which aims to design efficient delivery routes in urban environments ...

In this study, we propose an exact method for optimizing a linear function over the efficient set of a multi-objective transportation problem (MOTP). This type of problem arises when a decision maker ...

Like the rest of its Big Tech cadre, Google has spent lavishly on developing generative AI models. Google’s AI can clean up your text messages and summarize the web, but the company is constantly ...

Article Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to ...

Companies like OpenAI and China’s DeepSeek offer chatbots designed to take their time with an answer. Here’s how they work. By Cade Metz and Dylan Freedman Cade Metz reported from San Francisco and ...

Mixed Integer Linear Programming (MILP) is essential for modeling complex decision-making problems but faces challenges in computational tractability and requires expert formulation. Current deep ...

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community. Issues are used to track todos, bugs, feature requests, and more.

ABSTRACT: In this paper we compare track data association purity, accuracy, and timing on a simple, idealized model tracking problem for two data association methods: Global Nearest Neighbor (GNN) and ...