Sciweavers

2430 search results - page 157 / 486
» Computing Tutte Polynomials
Sort
View
AUTOMATICA
2007
108views more  AUTOMATICA 2007»
15 years 4 months ago
A minimum-time control strategy for torque tracking in permanent magnet AC motor drives
: A minimum-time torque control strategy for permanent-magnet ac motor drives is presented. The proposed solution is obtained by an ad-hoc procedure based on the computation of rea...
Franco Blanchini, Stefano Miani, Matteo Tomasini, ...
CAGD
2006
90views more  CAGD 2006»
15 years 4 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
Oleg Davydov, Rossana Morandi, Alessandra Sestini
JCAM
2010
108views more  JCAM 2010»
14 years 11 months ago
Lattices on simplicial partitions
In this paper, (d + 1)-pencil lattices on simplicial partitions in Rd are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition,...
Gasper Jaklic, Jernej Kozak, Marjeta Krajnc, Vito ...
AAAI
2011
14 years 4 months ago
Value Function Approximation in Reinforcement Learning Using the Fourier Basis
We describe the Fourier Basis, a linear value function approximation scheme based on the Fourier Series. We empirically evaluate its properties, and demonstrate that it performs w...
George Konidaris, Sarah Osentoski, Philip Thomas
STACS
2010
Springer
15 years 11 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen