1857 search results - page 150 / 372 » Minimum Degree Orderings |
157
click to vote
JGT
2007
15 years 6 months ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
176
click to vote
ICPPW
2008
IEEE
16 years 1 months ago
2008
IEEE
Event traces are helpful in understanding the performance behavior of message-passing applications since they allow in-depth analyses of communication and synchronization patterns...
188
click to vote
CONCUR
1992
Springer
15 years 10 months ago
1992
Springer
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...
165
click to vote
IPCO
2007
15 years 8 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
175
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper studies optimal input excitation design for parametric frequency response estimation. We will focus on least-squares estimation of Finite Impulse Response (FIR) models a...