Sciweavers

139 search results - page 10 / 28
» fgcs 1992
Sort
View
FGCS
2000
139views more  FGCS 2000»
13 years 7 months ago
Ant algorithms
This paper overviews recent work on ant algorithms, that is, algorithms for discrete optimization which took inspiration from the observation of ant colonies foraging behavior, an...
Marco Dorigo, Gianni Di Caro, Thomas Stützle
FGCS
2008
126views more  FGCS 2008»
13 years 7 months ago
A Service-Oriented Architecture enabling dynamic service grouping for optimizing distributed workflow execution
In this paper, we describe a Service-Oriented Architecture allowing the optimization of the execution of service workflows. We discuss the advantages of the serviceoriented approa...
Tristan Glatard, Johan Montagnat, David Emsellem, ...
FGCS
2008
99views more  FGCS 2008»
13 years 7 months ago
An innovative workflow mapping mechanism for Grids in the frame of Quality of Service
The advent of Grid environments made feasible the solution of computational intensive problems in a reliable and cost-effective way. As workflow systems carry out more complex and...
Dimosthenis Kyriazis, Konstantinos Tserpes, Andrea...
FGCS
2006
115views more  FGCS 2006»
13 years 7 months ago
A universal performance factor for multi-criteria evaluation of multistage interconnection networks
The choice of an interconnection network for a parallel computer depends on a large number of performance factors which are very often application dependent. We propose a performa...
Ahmad Chadi Aljundi, Jean-Luc Dekeyser, M. Tahar K...
FGCS
2006
83views more  FGCS 2006»
13 years 7 months ago
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
Anne Benoit, Brigitte Plateau, William J. Stewart