Sciweavers

5465 search results - page 83 / 1093
» Assigning Types to Processes
Sort
View
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
14 years 9 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
15 years 4 months ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer
PLILP
1990
Springer
15 years 1 months ago
Efficient Data Representation in Polymorphic Languages
Languages with polymorphic types (e.g. ML) have traditionally been implemented using Lisp-like data representations--everything has to fit in one word, if necessary by being heap-...
Xavier Leroy
BIRTHDAY
2008
Springer
14 years 12 months ago
Session and Union Types for Object Oriented Programming
In network applications it is crucial to have a mechanism to guarantee that communications evolve correctly according to the agreed protocol. Session types offer a method for abstr...
Lorenzo Bettini, Sara Capecchi, Mariangiola Dezani...
DAGSTUHL
2007
14 years 11 months ago
Graph matching with type constraints on nodes and edges
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
Catherine Fraikin, Paul Van Dooren