Concept

Feasible region

Publications associées (155)

Lateral Strain Profile as Key Technology Booster for All-Silicon Tunnel FETs

Mihai Adrian Ionescu, Katherine Boucart, Walter Riess

In this letter, we propose a lateral asymmetric strain profile in a silicon nanowire or ultrathin silicon film as a key technology booster for the performance of all-silicon Tunnel FETs. We demonstrate by simulation that a Gaussian tensile-strain profile w ...

Institute of Electrical and Electronics Engineers2009

Parametric integer programming in fixed dimension

Friedrich Eisenbrand, Gennady Shmonin

We consider the following problem: Given a rational matrix

A \in \mathbb{Q}^{m \times n}

and a rational polyhedron

Q \subseteq \mathbb{R}^{m+p}

, decide if for all vectors

b \in \mathbb{R}^m

, for which there exists an integral

z \in \mathbb{Z}^p

suc ...

2008

A graph coloring heuristic using partial solutions and a reactive tabu scheme

Nicolas Zufferey

Most of the recent heuristics for the graph coloring problem start from an infeasible k-coloring (adjacent vertices may have the same color) and try to make the solution feasible through a sequence of color exchanges. In contrast, our approach (called FOO- ...

2008

Linear Arithmetic with Stars

Viktor Kuncak, Ruzica Piskac

We consider an extension of integer linear arithmetic with a “star” operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We show that the satisfiability problem for this extended language remains in NP (and th ...

Springer2008

Process Optimization via Constraints Adaptation

Dominique Bonvin, Benoît Chachuat, Alejandro Gabriel Marchetti

In the framework of real-time optimization, measurement-based schemes have been developed to deal with plant-model mismatch and process variations. These schemes differ in how the feedback information from the plant is used to adapt the inputs. A recent id ...

2008

Monotone Comparative Statics: Geometric Approach

Thomas Alois Weber

We consider the comparative statics of solutions to parameterized optimization problems. A geometric method is developed for finding a vector field that, at each point in the parameter space, indicates a direction in which monotone comparative statics obta ...

Springer Verlag2008

Reservoir Optimization in Recurrent Neural Networks using Kronecker Kernels

Martin Hasler, Ali Ajdari Rad, Mahdi Jalili

In this paper, using the mathematical properties of self-kronecker-production of small size random matrices, a simple but effective method is presented to optimize the reservoir of an echo state network given a certain task. The experimental results invest ...

IEEE2008

Real-time suboptimal model predictive control using a combination of explicit MPC and online optimization

Colin Neil Jones, Melanie Nicole Zeilinger

Limits on the storage space or the computation time restrict the applicability of model predictive controllers (MPC) in many real problems. Currently available methods either compute the optimal controller online or derive an explicit control law. In this ...

IEEE2008

Graph colouring approaches for a satellite range scheduling problem

Nicolas Zufferey, Patrick Amstutz, Philippe Giaccari

A goal of this paper is to efficiently adapt the best ingredients of the graph colouring techniques to an NP-hard satellite range scheduling problem, called MuRRSP. We propose two new heuristics for the MuRRSP, where as many jobs as possible have to be sch ...

2008

Control and Optimization Methods for Traffic Signal Control in Large-scale Congested Urban Road Networks

he problem of designing real-time traffic signal control strategies for large-scale congested urban road networks via suitable application of control and optimization methods is considered. Three alternative methodologies are proposed, all based on the sto ...

IEEE2007

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

Parametric integer programming in fixed dimension

Friedrich Eisenbrand, Gennady Shmonin

We consider the following problem: Given a rational matrix

A \in \mathbb{Q}^{m \times n}

and a rational polyhedron

Q \subseteq \mathbb{R}^{m+p}

, decide if for all vectors

b \in \mathbb{R}^m

, for which there exists an integral

z \in \mathbb{Z}^p

suc ...

2008