2957 search results - page 348 / 592 » The Complexity of Polynomial-Time Approximation |
133
click to vote
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
The choice of transfer functions may strongly influence complexity and performance of neural networks used in classification and approximation tasks. A taxonomy of activation an...
162
click to vote
ICRA
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper presents a new velocity blending approach to the problem of task space trajectory generation. To compare this technique with others, a generalized formulation for task ...
204
click to vote
COCO
1993
Springer
15 years 10 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
165
click to vote
CAV
2007
Springer
15 years 10 months ago
2007
Springer
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
175
click to vote
COLT
2004
Springer
15 years 10 months ago
2004
Springer
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...