Publication

OASIS: An integrated optimisation framework for activity scheduling

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

Decentralized list scheduling

Nicolas Gabriel Gast, Denis Trystram

Classical list scheduling is a very popular and efficient technique for scheduling jobs for parallel and distributed platforms. It is inherently centralized. However, with the increasing number of processors, the cost for managing a single centralized list ...

2013

Bidder optimal assignments for general utilities

Monika Henzinger, Ingmar Weber

We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions u(i,j)(p(j)) expressing his utility of being matched to item j at price p(j). For this setting we prove that a bidder optimal outcome al ...

Elsevier Science Bv2013

Multi-resource allocation in stochastic project scheduling

Daniel Kuhn, Wolfram Wiesemann

We propose a resource allocation model for project scheduling. Our model accommodates multiple resources and decision-dependent activity durations inspired by microeconomic theory. First, we elaborate a deterministic problem formulation. In a second stage, ...

2012

Zeta: Scheduling Interactive Services with Partial Execution

James Richard Larus, Sameh Mohamed Elnikety, Chenyu Yan

This paper presents a scheduling model for a class of interactive services in which requests are time bounded and lower result quality can be traded for shorter execution time. These applications include web search engines, finance servers, and other inter ...

ACM2012

Bits from Photons: Oversampled Image Acquisition Using Binary Poisson Statistics

Martin Vetterli, Luciano Sbaiz, Yue Lu, Feng Yang

We study a new image sensor that is reminiscent of traditional photographic film. Each pixel in the sensor has a binary response, giving only a one-bit quantized measurement of the local light intensity. To analyze its performance, we formulate the oversam ...

Institute of Electrical and Electronics Engineers2012

, , ,

The goal of jointly providing fairness and efficiency in wireless networks can be seen as the problem of maximizing a given utility function. The main difficulty when solving this problem is that the capacity region of wireless networks is typically unknow ...

2011

, , ,

EPFL2011

The effects of practice schedule on learning a complex judgment task were investigated. In Experiment 1, participants' judgment accuracy on a retention test was higher after a random practice schedule than after a blocked schedule or operational schedule. ...

2011

Many instructional strategies that appear to improve learners' performance during training may not realize adequate posttest performance or transfer to a job. The converse has been found to be true as well: Instructional strategies that appear to slow the ...

2011

, ,

We address the problem of joint optimal rate allocation and scheduling between media source rate and error protection rate in scalable streaming applications over lossy multipath networks. Starting from a distortion representation of the received media inf ...

Institute of Electrical and Electronics Engineers2009