8132 search results - page 78 / 1627 » Dependability, Abstraction, and Programming |
163
click to vote
EUROPAR
2007
Springer
16 years 13 days ago
2007
Springer
The performance of many scientific applications for distributed memory platforms can be increased by utilizing multiprocessor-task programming. To obtain the minimum parallel runt...
156
click to vote
ISCA
1992
IEEE
15 years 10 months ago
1992
IEEE
A quantitative analysis of program execution is essential to the computer architecture design process. With the current trend in architecture of enhancing the performance of unipr...
180
click to vote
ACL
2009
15 years 4 months ago
2009
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
182
click to vote
LOPSTR
2009
Springer
16 years 25 days ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
140
click to vote
ICDM
2005
IEEE
15 years 12 months ago
2005
IEEE
Bayesian Network (BN) is a powerful network model, which represents a set of variables in the domain and provides the probabilistic relationships among them. But BN can handle dis...