Interchangeability with thresholds and degradation factors for Soft CSPs

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

Modern optimization is tasked with handling applications of increasingly large scale, chiefly due to the massive amounts of widely available data and the ever-growing reach of Machine Learning. Consequently, this area of research is under steady pressure t ...

Sample efficiency is a fundamental challenge in de novo molecular design. Ideally, molecular generative models should learn to satisfy a desired objective under minimal calls to oracles (computational property predictors). This problem becomes more apparen ...

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

This paper studies the problem of online performance optimization of constrained closed-loop control systems, where both the objective and the constraints are unknown black-box functions affected by exogenous time-varying contextual disturbances. A primal- ...

Omnidirectional video streaming is usually implemented based on the representations of tiles, where the tiles are obtained by splitting the video frame into several rectangular areas and each tile is converted into multiple representations with different r ...

The problem of learning graphons has attracted considerable attention across several scientific communities, with significant progress over the re-cent years in sparser regimes. Yet, the current techniques still require diverg-ing degrees in order to succe ...

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

The advent of comprehensive synaptic wiring diagrams of large neural circuits has created the field of connectomics and given rise to a number of open research questions. One such question is whether it is possible to reconstruct the information stored in ...

Control systems operating in real-world environments often face disturbances arising from measurement noise and model mismatch. These factors can significantly impact the perfor- mance and safety of the system. In this thesis, we aim to leverage data to de ...

Under certain conditions, the ionization of a molecule may create a superposition of electronic states, leading to ultrafast electron dynamics. If controlled, this motion could be used in attochemistry applications, but it has been shown that the decoheren ...

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

Context. A novel high-performance exact pair-counting toolkit called fast correlation function calculator (FCFC) is presented.Aims. With the rapid growth of modern cosmological datasets, the evaluation of correlation functions with observational and simula ...

In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Residual stresses in hot-rolled wide flange steel cross sections may lead to premature yielding, accelerated corrosion and brittle fracture of steel members. The above phenomena lead to a loss of a steel member's stiffness and resistance under mechanical l ...

Background: Although digital mobility outcomes (DMOs) can be readily calculated from real-world data collected with wearable devices and ad-hoc algorithms, technical validation is still required. The aim of this paper is to comparatively assess and validat ...

Interchangeability with thresholds and degradation factors for Soft CSPs

Chattez avec Graph Search

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Scalable constrained optimization

Augmented Memory: Sample-Efficient Generative Molecular Design with Reinforcement Learning

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Learning to Remove Cuts in Integer Linear Programming

A ride time-oriented scheduling algorithm for dial-a-ride problems

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints

Quality-Constrained Encoding Optimization for Omnidirectional Video Streaming

Learning Sparse Graphons And The Generalized Kesten-Stigum Threshold

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Bayesian reconstruction of memories stored in neural networks from their connectivity

Data-Driven Control and Optimization under Noisy and Uncertain Conditions

How to Find Molecules with Long-lasting Charge Migration?

Approximation Algorithms for Allocation and Network Design

Fast correlation function calculator A high-performance pair-counting toolkit

Fairness and Explainability in Clustering Problems

Results on Sparse Integer Programming and Geometric Independent Sets

Proposed residual stress model for hot‐rolled wide flange steel cross sections

Assessing real-world gait with digital technology? Validation, insights and recommendations from the Mobilise-D consortium