Branch-and-Prune Search Strategies for Numerical Constraint Solving
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This paper describes an efficient algorithm to predict the RF gas breakdown power threshold in microwave devices with complex geometries. The two necessary calculations when investigating such a phenomenon have been performed: on the one hand, the computat ...
We consider the problem of computing additively approximate Nash equilibria in noncooperative two-player games. We provide a new polynomial time algorithm that achieves an approximation guarantee of 0.36392. We first provide a simpler algorithm, that achie ...
We consider the problem of distributed classification of multiple observations of the same object that are collected in an ad hoc network of vision sensors. Assuming that each sensor captures a different observation of the same object, the problem is to cl ...
Institute of Electrical and Electronics Engineers2011
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage and processing is an important challenge in this context. The recent formali ...
The aim of this dissertation is to solve numerically the following problem, denoted by P : given a Riemannian manifold and two points a and b belonging to that manifold, find a tangent vector T at a, such that expa(T) = b, assuming that T exists. This prob ...
In this thesis, we focus on standard classes of problems in numerical optimization: unconstrained nonlinear optimization as well as systems of nonlinear equations. More precisely, we consider two types of unconstrained nonlinear optimization problems. On t ...
We consider the school bus routing and scheduling problem, where transportation demand is known and bus scheduling can be planned in advance. We present a comprehensive methodology designed to support the decision of practitioners. We first propose a model ...
Analysing and optimising electromagnetic structures like filters, multiplexers, printed circuits and antennas etc. demand for electromagnetic CAD tools to be accurate and fast at the same time. In very rare cases a closed form (approximate) solution of the ...
In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-face ...
In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-face ...
