Concept

Logique ternaire

Publications associées (39)

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

Structural Changes in Industrial R&D in Europe and the US

Dominique Foray, Stéphane Lhuillery

We analyse the structural changes that have characterised the organisation of industrial R&D over the last 25 years. Taking Mowery's work (Industrial and Corporate Change, 2009, 18(1), 1-50) on the US as a starting point, we reconsider the different aspect ...

Beech Tree Publishing, Oxford2010

On Decision Procedures for Collections, Cardinalities, and Relations

Viktor Kuncak, Ruzica Piskac

Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make such logics more useful in verification this paper extends them with the ability to co ...

2009

Data-flow transformations to maximize the use of carry-save representation in arithmetic circuits

Paolo Ienne, Philip Brisk, Ajay Kumar Verma

The increasing importance,of datapath circuits in complex systems-on-chip calls for special arithmetic optimizations. The goal is to automatically achieve the handcrafted results which escape classic logic optimizations. Some work has been done in the rece ...

2008

Lazy Shape Analysis

Dirk Thilo Beyer, Grégory Théoduloz

Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is difficult to find adequate predicate abstractions for the heap. In contrast, shape analy ...

Springer2006

Exploiting Binary Abstractions in Deciphering Gene Interactions

Giovanni De Micheli, Abhishek Garg

We consider computationally reconstructing gene regulatory networks on top of the binary abstraction of gene expression state information. Unlike previous Boolean network approaches, the proposed method does not handle noisy gene expression values directly ...

2006

The Role of Tarski’s Declarative Semantics in the Design of Modeling Languages

Alain Wegmann, Andrey Naumenko

This paper focuses on Tarski

s declarative semantics and their usefulness in the design of a modeling language. We introduce the principles behind Tarski

s approach to semantics and explain what advantages this offers in the context of modeling languages. ...

2003

Building blocks for secure services

Levente Buttyan

This thesis is concerned with two security mechanisms: authenticated key transport and rational exchange protocols. These mechanisms are potential building blocks in the security architecture of a range of different services. Authenticated key transport pr ...

EPFL2002

The Ecoparc project in Neuchâtel : sustainable regeneration of an urban wasteland

The increasing importance of sustainability in town planning and architectural design is strongly questioning the actual logic of built environment dispersion. The peripheral extension of cities is indeed leading to irrational uses of ground, growing envir ...

2002

Attenuation of Cross-Peak Intensities in QUIET-BIRD-NOESY Experiments

Geoffrey Bodenhausen

The buildup curves in QUIET-BIRD-NOESY expts., which are designed to isolate two-spin subsystems within macromols., are attenuated by transverse relaxation and evolution under homonuclear couplings during the bilinear rotation decoupling (BIRD) pulse sandw ...

1999