5624 search results - page 740 / 1125 » On Conditional Covering Problem |
125
click to vote
CAD
2004
Springer
15 years 4 months ago
2004
Springer
In this paper, we study the problem of constructing a family of surfaces from a given spatial geodesic curve. We derive a parametric representation for a surface pencil whose memb...
122
click to vote
CN
2004
15 years 4 months ago
2004
Pricing has become one of the main challenges of the networking community and is receiving a great deal of interest in the literature. In this paper, we analyze the so-called Pari...
153
Voted
ENDM
2002
15 years 4 months ago
2002
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
116
click to vote
JSA
2000
15 years 4 months ago
2000
In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that may share resources in exclusive mode in a dynamic e...
133
click to vote
MOC
2000
15 years 4 months ago
2000
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...