Sciweavers

674 search results - page 104 / 135
» The computational complexity of the parallel knock-out probl...
Sort
View
EUROPAR
2007
Springer
15 years 7 months ago
Negotiation Strategies Considering Opportunity Functions for Grid Scheduling
In Grid systems, nontrivial qualities of service have to be provided to users by the resource providers. However, resource management in a decentralized infrastructure is a complex...
Jiadao Li, Kwang Mong Sim, Ramin Yahyapour
CONCUR
2004
Springer
15 years 6 months ago
Model Checking Timed Automata with One or Two Clocks
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
François Laroussinie, Nicolas Markey, Ph. S...
EUROPAR
2004
Springer
15 years 6 months ago
More Legal Transformations for Locality
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
Cédric Bastoul, Paul Feautrier
ASAP
2004
IEEE
171views Hardware» more  ASAP 2004»
15 years 5 months ago
CHARMED: A Multi-Objective Co-Synthesis Framework for Multi-Mode Embedded Systems
In this paper, we present a modular co-synthesis framework called CHARMED that solves the problem of hardware-software co-synthesis of periodic, multi-mode, distributed, embedded ...
Vida Kianzad, Shuvra S. Bhattacharyya
PODC
2009
ACM
16 years 1 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher