500 search results - page 80 / 100 » A parallel quadratic programming method for dynamic optimiza... |
120
click to vote
JMLR
2010
14 years 5 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
101
click to vote
ICPP
1999
IEEE
15 years 3 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
73
Voted
CORR
2007
Springer
14 years 11 months ago
2007
Springer
—For a stationary additive Gaussian-noise channel with a rational noise power spectrum of a finite-order L, we derive two new results for the feedback capacity under an average ...
82
Voted
ASPDAC
2007
ACM
15 years 3 months ago
2007
ACM
Parallel prefix adder is the most flexible and widely-used binary adder for ASIC designs. Many high-level synthesis techniques have been developed to find optimal prefix structures...
112
click to vote
IPPS
2005
IEEE
15 years 4 months ago
2005
IEEE
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...