Sciweavers

963 search results - page 92 / 193
» On the decomposition of rational functions
Sort
View
JC
2011
87views more  JC 2011»
13 years 3 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
IJCAI
1989
13 years 10 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
14 years 1 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
CORR
2004
Springer
137views Education» more  CORR 2004»
13 years 8 months ago
Implementation of Logical Functions in the Game of Life
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
Jean-Philippe Rennard
SIAMCO
2002
121views more  SIAMCO 2002»
13 years 8 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak