6105 search results - page 318 / 1221 » A Parallel Algorithm for Bound-Smoothing |
174
click to vote
HPCS
2005
IEEE
16 years 10 days ago
2005
IEEE
— With the principal goal of developing an alternative, relatively simple and tractable pricing framework for accurately reproducing a market implied volatility surface, this pap...
173
click to vote
SAINT
2005
IEEE
16 years 9 days ago
2005
IEEE
This paper presents a case study to effectively run a parallel branch and bound application on the Grid. The application discussed in this paper is a fine-grain application and is...
164
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R+-tree spatial data structures is compared...
173
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
185
Voted
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...