2694 search results - page 263 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
175
click to vote
IPPS
2006
IEEE
16 years 16 days ago
2006
IEEE
This paper explores the relation between the structured parallelism exposed by the Decomposable BSP (DBSP) model through submachine locality and locality of reference in multi-lev...
170
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
198
click to vote
PDPTA
2010
15 years 4 months ago
2010
Though the GPGPU concept is well-known in image processing, much more work remains to be done to fully exploit GPUs as an alternative computation engine. The difficulty is not refo...
161
click to vote
HPCC
2005
Springer
16 years 1 days ago
2005
Springer
With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to op...
185
click to vote
EUROGP
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Genetic Programming has been slow at realizing other programming paradigms than conventional, deterministic, sequential vonNeumann type algorithms. In this contribution w...