3038 search results - page 115 / 608 » High-Speed Function Approximation |
173
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
148
click to vote
DATE
2002
IEEE
15 years 10 months ago
2002
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. For high-spee...
166
click to vote
JCM
2008
15 years 4 months ago
2008
An analytical model is developed to solve the power-rate assignment problem for multi-rate CDMA systems and calculate the probability density function (PDF) for the downlink traffi...
127
click to vote
JAT
2010
14 years 11 months ago
2010
For r 3, n N and each 3-monotone continuous function f on [a, b] (i.e., f is such that its third divided differences [x0, x1, x2, x3] f are nonnegative for all choices of distin...
135
Voted
CEC
2003
IEEE
15 years 10 months ago
2003
IEEE
Neural networks and the Kriging method are compared for constructing £tness approximation models in evolutionary optimization algorithms. The two models are applied in an identica...