Concept

Graphe d'intervalles

Publications associées (26)

On the stable set polytope of claw-free graphs

In this thesis we focus our attention on the stable set polytope of claw-free graphs. This problem has been open for many years and albeit all the efforts engaged during those last three years, it is still open. This does not mean that no progress has been ...

EPFL2005

Suboptimal colorings and solution of large chromatic scheduling problems

Ivo Blöchliger

Graph Coloring is a very active field of research in graph theory as well as in the domain of the design of efficient heuristics to solve problems which, due to their computational complexity, cannot be solved exactly (no guarantee that an optimal solution ...

EPFL2005

Measurement of the time-dependent CP-violating asymmetry in BO→KSOπOγ decays

Aurelio Bay, Stewart Cole, Tagir Aushev, Sun Hee Kim, Sanjeev Kumar, Jing Li

We present a new measurement of CP-violation parameters in B0→KS0π0γ decay based on a sample of 275×106 BB̄ pairs collected at the Υ(4S) resonance with the Belle detector at the KEKB energy-asymmetric e+e- collider. One of the B mesons is fully reconstruct ...

2005

Time-dependent CP-violating asymmetries in b→sq q transitions

Olivier Schneider, Aurelio Bay, Mingkui Wang, Chao Wang, Tagir Aushev, Lei Zhang, Sun Hee Kim, Sanjeev Kumar, Jing Li

We present new measurements of CP-violation parameters in B0→K0, K+K-KS0, f0(980)KS0, η′KS0, ωKS0, and KS0π0 decays based on a sample of 275×106 BB̄ pairs collected at the Υ(4S) resonance with the Belle detector at the KEKB energy-asymmetric e+e- collider. ...

2005

Study of time-dependent CP-violating asymmetries in b→sq̄q decays

Aurelio Bay, Tagir Aushev, Ji Hyun Kim, Donghyun Kim

We present a measurement of CP-violation parameters in the b→sq̄q penguin transitions (q = s,u,d) based on a 78 fb-1 data sample collected at the Y(4S) resonance with the Belle detector at the KEKB energyasymmetric e+e- collider. One neutral B meson is rec ...

2003

Register Allocation in the SPUR Lisp Compiler

James Richard Larus

Register allocation is an important component of most compilers, particularly those for RISC machines. The SPUR Lisp compiler uses a sophisticated, graph-coloring algorithm developed by Fredrick Chow [Chow84]. This paper describes the algorithm and the tec ...

ACM1986

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