4926 search results - page 356 / 986 » Two Graph Algorithms On an Associative Computing Model |
140
click to vote
RTCSA
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
146
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
125
click to vote
SIAMSC
2008
15 years 4 months ago
2008
Standing (solitary)-wave/steady-state solutions in many nonlinear wave motions and Schrodinger flows lead to nonlinear eigenproblems. In [X. Yao and J. Zhou, SIAM J. Sci. Comput., ...
150
click to vote
ASPDAC
2001
ACM
15 years 8 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
152
click to vote
FSS
2008
15 years 4 months ago
2008
The grade of membership (GoM) model uses fuzzy sets as memberships of each individual to extreme profiles (or classes) on the likelihood function of multivariate multinomial distr...