Concept

Utility computing

Publications associées (98)

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

Composite Kernel Learning

The Support Vector Machine (SVM) is an acknowledged powerful tool for building classifiers, but it lacks flexibility, in the sense that the kernel is chosen prior to learning. Multiple Kernel Learning (MKL) enables to learn the kernel, from an ensemble of ...

IDIAP2008

Pervasive Computing with Frugal Objects

Rachid Guerraoui, Maxime Monod, Benoît Garbinato, Jesper Honig Spring

This paper presents a computing model for resource-limited mobile devices that might be ubiquitously deployed in private and business environments. The model integrates a strongly-typed event-based communication paradigm with abstractions for frugal contro ...

2007

Pervasive Computing with Frugal Objects

Rachid Guerraoui, Maxime Monod, Benoît Garbinato, Jesper Honig Spring

2007

The Heard-Of Model: Computing in Distributed Systems with Benign Failures

André Schiper

Problems in fault-tolerant distributed computing have been studied in a variety of models. These models are structured around two central ideas: Degree of synchrony and failure model are two independent parameters that determine a particular type of system ...

2007

Frugal Mobile Objects

Rachid Guerraoui, Maxime Monod, Benoît Garbinato, Jesper Honig Spring

This paper presents a computing model for resource-limited mobile devices. The originality of the model lies in the integration of a stronglytyped event-based communication paradigm with abstractions for frugal control, assuming a small footprint runtime. ...

2006

Rendering massive real-time crowds

Pablo Stanislaw De Heras Ciechomski

This thesis presents how to visualize a large crowd of virtual human characters in real time on a standard issue personal computer. The virtual humans are distributed into rendering fidelities such that the humans closer to the viewer are detailed and expr ...

EPFL2006

An integral-equation technique for solving thick irises in rectangular waveguides

Juan Ramon Mosig, Ivica Stevanovic, Pedro Crespo Valero

This paper presents an efficient integral-equation (IE) technique for analysis of thick irises inside multilayered rectangular waveguides. The IEs remain the same as in the case of zero-thickness iris and the thickness is accounted for only as a correction ...

2006

A General Characterization of Indulgence (Invited Paper)

Rachid Guerraoui

An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates arbitrarily long periods of instability, with an unbounded number of timing and scheduling failures. In particular, no process can take any irrevoca ...

2006

Continuous Bytecode Instruction Counting for CPU Consumption Estimation

Andrea Camesi

As an execution platform, the Java Virtual Machine (JVM) provides many benefits in terms of portability and security. However, this advantage turns into an obstacle when it comes to determining the computing resources (CPU, memory) a program will require t ...

IEEE Computer Society Press2006

Continuous Bytecode Instruction Counting for CPU Consumption Estimation

Andrea Camesi

2006