409 search results - page 61 / 82 » Matching Scenarios with Timing Constraints |
106
Voted
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
175
Voted
COMPSAC
2004
IEEE
15 years 5 months ago
2004
IEEE
Web services (WS) received significant attention recently because services can be searched, bound, and executed at runtime over the Internet. This paper proposes a dynamic reconfi...
118
click to vote
AAAI
2007
15 years 4 months ago
2007
Automation of Web service composition is one of the most interesting challenges facing the Semantic Web today. In this paper we propose a mean of performing automated Web service ...
124
click to vote
CCGRID
2008
IEEE
15 years 2 months ago
2008
IEEE
In this paper, we describe the design and implementation of two mechanisms for fault-tolerance and recovery for complex scientific workflows on computational grids. We present our ...
113
click to vote
TPDS
2008
15 years 1 months ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...