Concept

Knapsack problem

Related publications (775)

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.

From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization

Immanuel Trummer

The goal of query optimization is to map a declarative query (describing data to generate) to a query plan (describing how to generate the data) with optimal execution cost. Query optimization is required to support declarative query interfaces. It is a co ...

EPFL2016

Lightfields behind amplitude masks Creating phase discontinuities

Hans Peter Herzig, Toralf Scharf, Wilfried Noell, Myun Sik Kim, Krishnaparvathy Puthankovilakam

Shaping of light fields behind amplitude and phase masks the basis the lithographic structure reproduction. The aerial image or better the intensity distribution defines the resolution of the structure to be printed. Contrast is the main parameter and to a ...

Ieee2016

Undecidability through Fourier series

In computability theory a variety of combinatorial systems are encountered (word problems, production systems) that exhibit undecidability properties. Here we seek such structures in the realm of Analysis, more specifically in the area of Fourier Analysis. ...

Elsevier Science Bv2016

On the Difficulty of Selecting Ising Models with Approximate Recovery

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we consider the problem of estimating the underlying graph associated with an Ising model given a number of independent and identically distributed samples. We adopt an approximate recovery criterion that allows for a number of missed edges ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Collision-Free Pattern Formation

Rachid Guerraoui, Alexandre David Olivier Maurer

Shoals of small fishes can change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. In this paper, we study the analog problem of distributed pattern formation. A set of processes needs to move ...

2016

Selected Aspects Of Designing Deep Excavations

Rafal Filip Obrzud

This paper analyzes two approaches to serviceability limit state (SLS) verification for the deep excavation boundary value problem. The verification is carried out by means of the finite element (FE) method with the aid of the commercial program ZSoil v201 ...

Walter de Gruyter GmbH2016

APPROXIMATING k-MEDIAN VIA PSEUDO-APPROXIMATION

Ola Nils Anders Svensson

We present a novel approximation algorithm for k-median that achieves an approximation guarantee of 1 + root 3 + epsilon, improving upon the decade-old ratio of 3 + epsilon. Our improved approximation ratio is achieved by exploiting the power of pseudo-app ...

Siam Publications2016

ELiSeD – An Event-Based Line Segment Detector

Davide Scaramuzza

Event-based temporal contrast vision sensors such as the Dynamic Vison Sensor (DVS) have advantages such as high dynamic range, low latency, and low power consumption. Instead of frames, these sensors produce a stream of events that encode discrete amounts ...

2016

Phase analysis of amplitude binary mask structures

Hans Peter Herzig, Toralf Scharf, Krishnaparvathy Puthankovilakam

Shaping of light behind masks using different techniques is the milestone of the printing industry. The aerial image distribution or the intensity distribution at the printing distances defines the resolution of the structure after printing. Contrast and p ...

Spie-Int Soc Optical Engineering2016

Online Auctions for Dynamic Assignment: Theory and Empirical Evaluation

Boi Faltings, Sujit Prakash Gujar

Dynamic resource assignment is a common problem in multi-agent systems. We consider scenarios in which dynamic agents have preferences about assignments and the resources that can be assigned using online auctions. We study the trade-off between the follow ...

Ios Press2016