2474 search results - page 108 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
128
click to vote
ICPADS
2005
IEEE
15 years 10 months ago
2005
IEEE
: Accurate reconstruction of phylogenetic trees very often involves solving hard optimization problems, particularly the maximum parsimony (MP) and maximum likelihood (ML) problems...
125
click to vote
ECOOPW
1999
Springer
15 years 9 months ago
1999
Springer
Unwanted effects of aliasing cause encapsulation problems in object oriented programming. Nevertheless, aliasing is part of common and efficient programming techniques for expres...
142
click to vote
EUROPAR
2007
Springer
15 years 11 months ago
2007
Springer
We investigate the problem of detecting termination of a distributed computation in an asynchronous message-passing system where processes may crash and recover. We show that it is...
162
click to vote
PPSN
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
163
click to vote
PC
2002
15 years 4 months ago
2002
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...