Sciweavers

5465 search results - page 24 / 1093
» Assigning Types to Processes
Sort
View
ISPDC
2005
IEEE
14 years 1 months ago
A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...
Daniel Grosu, Thomas E. Carroll
ETFA
2008
IEEE
14 years 2 months ago
Optimal on-line (m, k)-firm constraint assignment for real-time control tasks based on plant state information
1 In this paper, we study the problem of scheduling a set of control tasks. We distinguish three different situations of states of controlled plants: not activated, steady state si...
Felicioni Flavia, Jia Ning, Françoise Simon...
CSL
2000
Springer
13 years 12 months ago
Subtyping with Power Types
This paper introduces a typed λ-calculus called λPower , a predicative reformulation of part of Cardelli’s power type system. Power types integrate subtyping into the typing t...
David Aspinall
CSL
2009
Springer
13 years 11 months ago
Intersection, Universally Quantified, and Reference Types
The aim of this paper is to understand the interplay between intersection, universally quantified, and reference types. Putting together the standard typing rules for intersection,...
Mariangiola Dezani-Ciancaglini, Paola Giannini, Si...
ICIP
2008
IEEE
14 years 9 months ago
The path assigned mean shift algorithm: A new fast mean shift implementation for colour image segmentation
This paper presents a novel method for colour image segmentation derived from the mean shift theorem. When applied to colour image segmentation tasks, the path assigned mean
Akash Pooransingh, Cathy-Ann Radix, Anil C. Kokara...