575 search results - page 90 / 115 » Computing Maximum Subsequence in Parallel |
ASAP
2007
IEEE
14 years 22 days ago
2007
IEEE
Monte-Carlo simulations are used in many applications, such as option pricing and portfolio evaluation. Due to their high computational load and intrinsic parallelism, they are id...
HPCC
2007
Springer
14 years 2 months ago
2007
Springer
As Grids become increasingly relied upon as critical infrastructure, it is imperative to ensure the highly-available and secure day-to-day operation of the Grid infrastructure. The...
SPAA
2006
ACM
14 years 2 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
SPAA
2003
ACM
14 years 2 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
EUROPAR
1999
Springer
14 years 1 months ago
1999
Springer
Processor cycle time continues to decrease faster than main memory access times, placing higher demands on cache memory hierarchy performance. To meet these demands, conventional ...