Related publications (9)

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...
Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

On flexible Green function methods for atomistic/continuum coupling

Max Ludwig Hodapp

Atomistic/continuum (A/C) coupling schemes have been developed during the past twenty years to overcome the vast computational cost of fully atomistic models, but have not yet reached full maturity to address many problems of practical interest. This work ...
EPFL2018

Logarithmic estimates for continuity equations

Maria Colombo

The aim of this short note is twofold. First, we give a sketch of the proof of a recent result proved by the authors in the paper [7] concerning existence and uniqueness of renormalized solutions of continuity equations with unbounded damping coefficient. ...
2016

Some applications of the Weil-Barner explicit formula

Thorsten Kleinjung

The Weil-Barner explicit formula is applied to the prime counting function and to the problem of numerical partial verification of the Riemann hypothesis. ...
Wiley-V C H Verlag Gmbh2013

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

Dominique de Werra

We study a multiprocessor extension of the preemptive open shop scheduling problem, where the set of processors is partitioned into processor groups. We show that the makespan minimization problem is polynomially solvable for two multiprocessor groups even ...
2010

Contribution to Integral Equation Techniques for Solving Electromagnetic Problems

Sergio Lopez Pena

Surface Mixed Potential Integral Equation (MPIE) formulations together with the Method of Moments (MoM) are widely used to solve electromagnetic problems. An accurate evaluation of the Green functions (GF) associated to the integral equation and of the cou ...
EPFL2010

Surface integral formulation for 3D simulations of plasmonic and high permittivity nanostructures

Olivier Martin, Andreas Kern

Among the most popular approaches used for simulating plasmonic systems, the discrete dipole approximation suffers from poorly scaling volume discretization and limited near-field accuracy. We demonstrate that transformation to a surface integral formulati ...
2009

Scheduling with Multiprocessors: A rounding network algorithm with a constant error

The candidate will study some special cases of preemptive open shop problems with multiprocessors. He will in particular concentrate on the situation when the processor set is partitioned into 2 multiprocessors. The two cases of preemptions (at integral ti ...
2005

Approximation for the exponential integral (Theis well function)

David Andrew Barry

In this note, we provide an analytical approximation to the exponential integral valid for all values of its argument. The approximation is constructed by interpolation between the exponential integral's small and large asymptotes.The interpolation contain ...
2000

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.