Publication

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

Publications associées (44)

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

Debugging by lastChange

Claude Petitpierre, Salman Mirghasemi

Developers often seek the origins of wrong values they see in their debugger. Their search must be backwards in time: the code causing the wrong value executed before the wrong value appeared. Searching with breakpoint- or log- based debuggers demands pers ...

2011

Querypoint : Moving Backwards on Wrong Values in the Buggy Execution

Claude Petitpierre, Salman Mirghasemi

As developers debug, they often have to seek the origins of wrong values they see in their debugger. This search must be performed backwards in time since the code causing the wrong value is executed before the wrong value appears. Therefore, locating the ...

2011

Optimal Linear Fusion for Distributed Detection Via Semidefinite Programming

Ali H. Sayed

Consider the problem of signal detection via multiple distributed noisy sensors. We study a linear decision fusion rule of [Z. Quan, S. Cui, and A. H. Sayed, ¿Optimal Linear Cooperation for Spectrum Sensing in Cognitive Radio Networks,¿ IEEE J. Sel. Topics ...

IEEE2010

Case Studies in Cost-Optimized Paneling of Architectural Freeform Surfaces

Mark Pauly, Mario Moacir Deuss

Paneling an architectural freeform surface refers to an approximation of the de- sign surface by a set of panels that can be manufactured using a selected technology at a reasonable cost, while respecting the design intent and achieving the desired aesthet ...

2010

Combining robustness and recovery for airline schedules

Niklaus Eggenberg

In this thesis, we address different aspects of the airline scheduling problem. The main difficulty in this field lies in the combinatorial complexity of the problems. Furthermore, as airline schedules are often faced with perturbations called disruptions ...

EPFL2009

Query-point Debugging

Salman Mirghasemi

Software Debugging is still one of the most challenging and time consuming aspects of software development. Monitoring the software behavior and finding the causes of this behavior are located at the center of debugging process. Although many tools and tec ...

2009

A hardware-software design framework for distributed cellular computing

Pierre-André Mudry, Michel Ganguin, Julien Ruffin

In this article, we describe a novel hardware-software design framework for prototyping cellular architectures in hardware. Based on an extensible platform of about 200 FPGAs, configured as a networked structure of processors, the hardware part of this com ...

2008

The Complexity of Distinguishing Distributions

Serge Vaudenay, Thomas Baignères

Cryptography often meets the problem of distinguishing distributions. In this paper we review techniques from hypothesis testing to express the advantage of the best distinguisher limited to a given number of samples. We link it with the Chernoff informati ...

Springer2008

A profiling framework for high level design space exploration for memory and system architectures

In 1971, the first microprocessor produced in mass production had 2300 transistor and was able to compute 60'000 operations per second at 740 kHz. Nowadays, even a common gaming console uses a central unit including 243 millions of transistors running at 4 ...

EPFL2007

Reverse Search for Parametric Linear Programming

Colin Neil Jones

This paper introduces a new enumeration technique for (multi)parametric linear programs (pLPs) based on the reverse-search paradigm. We prove that the proposed algorithm has a computational complexity that is linear in the size of the output (number of so- ...

IEEE2006