2957 search results - page 365 / 592 » The Complexity of Polynomial-Time Approximation |
157
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
199
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
175
click to vote
HAPTICS
2007
IEEE
16 years 26 days ago
2007
IEEE
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
148
click to vote
IWINAC
2007
Springer
16 years 21 days ago
2007
Springer
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
170
click to vote
SMI
2005
IEEE
16 years 3 days ago
2005
IEEE
Complex implicit CSG models can be represented hierarchically as a tree of nodes (the BlobTree) . However, current methods cannot be used to visualize changes made to these models...