Sciweavers

39 search results - page 5 / 8
» iandc 2008
Sort
View
IANDC
2008
111views more  IANDC 2008»
13 years 8 months ago
Bin packing with controllable item sizes
We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an a...
José R. Correa, Leah Epstein
IANDC
2008
131views more  IANDC 2008»
13 years 8 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
IANDC
2008
80views more  IANDC 2008»
13 years 8 months ago
Preemptive scheduling on a small number of hierarchical machines
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
György Dósa, Leah Epstein
IANDC
2008
95views more  IANDC 2008»
13 years 8 months ago
Comparing communication primitives via their relative expressive power
In this paper, we study sixteen communication primitives, arising from the combination of four useful programming features: synchronism (synchronous vs asynchronous primitives), a...
Daniele Gorla
IANDC
2008
87views more  IANDC 2008»
13 years 8 months ago
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...