Sciweavers

7758 search results - page 396 / 1552
» On the Number of Distributive Lattices
Sort
View
CEC
2008
IEEE
16 years 1 months ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
IPPS
2008
IEEE
16 years 1 months ago
Financial modeling on the cell broadband engine
High performance computing is critical for financial markets where analysts seek to accelerate complex optimizations such as pricing engines to maintain a competitive edge. In th...
Virat Agarwal, Lurng-Kuo Liu, David A. Bader
163
Voted
SPAA
2003
ACM
16 years 2 days ago
Relaxing the problem-size bound for out-of-core columnsort
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Corm...
APPT
2003
Springer
16 years 2 days ago
Optimal Broadcast Channel for Data Dissemination in Mobile Database Environment
The increase number of mobile users in wireless environment affects query access time substantially. To minimise the query access time, one possible way is to employ data broadcast...
Agustinus Borgy Waluyo, Bala Srinivasan, David Tan...
ISPAN
2002
IEEE
15 years 11 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu