Publications associées à On the complexity of fixed parameter clique and dominating set

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.

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Boi Faltings, Immanuel Trummer

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A s ...

Institute of Electrical and Electronics Engineers2014

Tight Bounds for Asynchronous Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual ...

Association for Computing Machinery2014

Matrix Recipes for Hard Thresholding Methods

Volkan Cevher, Anastasios Kyrillidis

In this paper, we present and analyze a new set of low-rank recovery algorithms for linear inverse problems within the class of hard thresholding methods. We provide strategies on how to set up these algorithms via basic ingredients for different configura ...

Springer Verlag2014

Functionally Optimized Neuritogenic Farinosone C Analogs: SAR-Study and Investigations on Their Mode of Action

Karl Gademann, Patrick Burch, Andrea Chicca

Several natural products derived from entomopathogenic fungi have been shown to initiate neuronal differentiation in the rat pheochromocytoma PC12 cell line. After the successful completion of the total synthesis program, the reduction of structural comple ...

Amer Chemical Soc2014

Stability Analysis of a Partitioned Fluid-Structure Thermal Coupling Algorithm

Pénélope Leyland, Ojas Joshi

Numerical multiphysics coupling is gaining more and more importance in engineering. Partitioned algorithms are among the most efficient methods to solve the coupled problem. However, they present some drawbacks, with the stability of the algorithm itself b ...

Amer Inst Aeronautics Astronautics2014

Right-Protected Data Publishing with Provable Distance-Based Mining

Michail Vlachos, Nikolaos Freris

Protection of one's intellectual property is a topic with important technological and legal facets. We provide mechanisms for establishing the ownership of a dataset consisting of multiple objects. The algorithms also preserve important properties of the d ...

Ieee Computer Soc2014

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer Verlag2012

How to Allocate Tasks Asynchronously

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Asynchronous task allocation is a fundamental problem in distributed computing in which p asynchronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key buildi ...

IEEE2012

On the complexity of fixed parameter clique and dominating set

Graph Chatbot

Chattez avec Graph Search

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Route choice models: bringing behavioral aspects into shortest path

Tight Bounds for Asynchronous Renaming

Matrix Recipes for Hard Thresholding Methods

Functionally Optimized Neuritogenic Farinosone C Analogs: SAR-Study and Investigations on Their Mode of Action

Stability Analysis of a Partitioned Fluid-Structure Thermal Coupling Algorithm

Right-Protected Data Publishing with Provable Distance-Based Mining

Generating Fast Indulgent Algorithms

Approximation Algorithms for Modern Multi-Processor Scheduling Problems

How to Allocate Tasks Asynchronously

Route choice models: bringing behavioral aspects into shortest path

Matrix Recipes for Hard Thresholding Methods

Approximation Algorithms for Modern Multi-Processor Scheduling Problems

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Tight Bounds for Asynchronous Renaming

Functionally Optimized Neuritogenic Farinosone C Analogs: SAR-Study and Investigations on Their Mode of Action

How to Allocate Tasks Asynchronously

Stability Analysis of a Partitioned Fluid-Structure Thermal Coupling Algorithm

Right-Protected Data Publishing with Provable Distance-Based Mining

Generating Fast Indulgent Algorithms