Sciweavers

2542 search results - page 222 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
TCS
2008
15 years 17 days ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
ML
2000
ACM
244views Machine Learning» more  ML 2000»
15 years 13 days ago
Learnable Evolution Model: Evolutionary Processes Guided by Machine Learning
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
Ryszard S. Michalski
TSMC
1998
126views more  TSMC 1998»
15 years 9 days ago
Decentralized adaptive fuzzy control of robot manipulators
—This paper develops a decentralized adaptive fuzzy control scheme for robot manipulators via a combination of genetic algorithm and gradient method. The controller for each link...
Yaochu Jin
TMI
2002
115views more  TMI 2002»
15 years 9 days ago
Discretization of the Radon transform and of its inverse by spline convolutions
Abstract--We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths and degrees . We apply our r...
Stefan Horbelt, Michael Liebling, Michael Unser
99
Voted
SAC
2008
ACM
15 years 4 days ago
Large-scale simulation of V2V environments
Providing vehicles with enhanced ability to communicate and exchange real-time data with neighboring vehicles opens up a variety of complex challenges that can only be met by comb...
Hugo Conceição, Luís Damas, M...