Sciweavers

4903 search results - page 784 / 981
» The Set Covering Machine
Sort
View
ICALP
2004
Springer
16 years 14 days ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
PLDI
2010
ACM
16 years 5 days ago
Supporting speculative parallelization in the presence of dynamic data structures
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
Chen Tian, Min Feng, Rajiv Gupta
202
Voted
FGR
2002
IEEE
229views Biometrics» more  FGR 2002»
16 years 1 days ago
An Approach to Automatic Recognition of Spontaneous Facial Actions
We present ongoing work on a project for automatic recognition of spontaneous facial actions. Spontaneous facial expressions differ substantially from posed expressions, similar t...
Bjorn Braathen, Marian Stewart Bartlett, Gwen Litt...
207
Voted
IPPS
2002
IEEE
16 years 15 hour ago
Utilization-Based Heuristics for Statically Mapping Real-Time Applications onto the HiPer-D Heterogeneous Computing System
Real-time applications continue to increase in importance as they are employed in various critical areas, such as command and control systems. These applications have traditionall...
Shoukat Ali, Jong-Kook Kim, Yang Yu, Shriram B. Gu...
178
Voted
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
15 years 12 months ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh