Sciweavers

2358 search results - page 117 / 472
» Revisiting communication performance models for computationa...
Sort
View
IJPP
2010
137views more  IJPP 2010»
15 years 2 months ago
Parallel Option Price Valuations with the Explicit Finite Difference Method
Abstract. We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in par...
Alexandros V. Gerbessiotis
ICPP
2000
IEEE
15 years 8 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
RTSS
2006
IEEE
15 years 10 months ago
Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks
Time-sensitive Wireless Sensor Network (WSN) applications require finite delay bounds in critical situations. This paper provides a methodology for the modeling and the worst-case...
Anis Koubaa, Mário Alves, Eduardo Tovar
ICPPW
2006
IEEE
15 years 10 months ago
m-LPN: An Approach Towards a Dependable Trust Model for Pervasive Computing Applications
Trust, the fundamental basis of ‘cooperation’ – one of the most important characteristics for the performance of pervasive ad hoc network-- is under serious threat with the ...
Munirul M. Haque, Sheikh Iqbal Ahamed
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
15 years 10 months ago
Discussion of parallel model of multi-objective genetic algorithms on heterogeneous computational resources
— In this paper, a parallel model of multi-objective genetic algorithm supposing a grid environment is discussed. In this proposed parallel model, we extended master-slave model ...
Tomoyuki Hiroyasu, Kengo Yoshii, Mitsunori Miki