2474 search results - page 96 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
118
click to vote
ISVC
2007
Springer
15 years 11 months ago
2007
Springer
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
147
click to vote
CCGRID
2003
IEEE
15 years 10 months ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
161
click to vote
VALUETOOLS
2006
ACM
15 years 10 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
178
click to vote
EUROPAR
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
171
click to vote
ICPP
2009
IEEE
15 years 2 months ago
2009
IEEE
There are two popular parallel I/O programming styles used by modern scientific computational applications: unique-file and shared-file. Unique-file I/O usually gives satisfactory ...