3475 search results - page 482 / 695 » Backbones in Optimization and Approximation |
145
click to vote
HEURISTICS
2002
15 years 6 months ago
2002
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
160
click to vote
MOC
1998
15 years 6 months ago
1998
We approximate the solution of initial boundary value problems for nonlinear parabolic equations. In space we discretize by finite element methods. The discretization in time is b...
180
click to vote
NCA
2007
IEEE
15 years 6 months ago
2007
IEEE
—Information about the spectral reflectance of a color surface is useful in many applications. Assuming that reflectance functions can be adequately approximated by a linear comb...
124
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— We present a new retraction algorithm for high DOF articulated models and use our algorithm to improve the performance of RRT planners in narrow passages. The retraction step i...
192
click to vote
TSMC
2008
15 years 5 months ago
2008
A new approach for engine calibration and control is proposed. In this paper, we present our research results on the implementation of adaptive critic designs for self-learning con...