Sciweavers

1120 search results - page 171 / 224
» Parallel Algorithmic Techniques for Combinatorial Computatio...
Sort
View
CONCUR
2006
Springer
13 years 11 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
HPDC
2008
IEEE
13 years 8 months ago
Collaborative ranking of grid-enabled workflow service providers
Service Oriented Architecture (SOA) and Grid computing are very hot research topics, nowadays. While Grid computing is aimed at sharing dynamically heterogeneous resources, SOAs i...
Domenico Laforenza, Franco Maria Nardini, Fabrizio...
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
11 years 10 months ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray
IPPS
2009
IEEE
14 years 2 months ago
A fusion-based approach for tolerating faults in finite state machines
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
Vinit A. Ogale, Bharath Balasubramanian, Vijay K. ...
IPPS
2009
IEEE
14 years 2 months ago
Adaptative clustering Particle Swarm Optimization
—The performance of Particle Swarm Optimization (PSO) algorithms depends strongly upon the interaction among the particles. The existing communication topologies for PSO (e.g. st...
Salomão S. Madeiro, Carmelo J. A. Bastos Fi...