5022 search results - page 682 / 1005 » Data structures and problem solving using Java |
130
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
161
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
In this paper, we introduce a novel algorithm to solve
global shape registration problems. We use gray-scale “images”
to represent source shapes, and propose a novel twocompo...
114
Voted
ICML
2002
IEEE
16 years 4 months ago
2002
IEEE
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
127
Voted
FGIT
2009
Springer
15 years 10 months ago
2009
Springer
GRID environments are privileged targets for computation-intensive problem solving in areas from weather forecasting to seismic analysis. Mainly composed by commodity hardware, th...
131
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
The performance of SIMD processors is often limited by the time it takes to transfer data between the centralized control unit and the parallel processor array. This is especially...