Sciweavers

610 search results - page 47 / 122
» Solving Geometrical Place Problems by using Evolutionary Alg...
Sort
View
121
Voted
COMPGEOM
2000
ACM
15 years 8 months ago
Fast software for box intersections
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
Afra Zomorodian, Herbert Edelsbrunner
169
Voted
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 2 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
127
Voted
PPL
2006
93views more  PPL 2006»
15 years 3 months ago
Inherently Parallel Geometric Computations
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
Selim G. Akl
136
Voted
GECCO
2003
Springer
15 years 8 months ago
Generative Representations for Evolving Families of Designs
Abstract. Since typical evolutionary design systems encode only a single artifact with each individual, each time the objective changes a new set of individuals must be evolved. Wh...
Gregory Hornby
GMP
2008
IEEE
113views Solid Modeling» more  GMP 2008»
15 years 10 months ago
Note on Industrial Applications of Hu's Surface Extension Algorithm
Abstract. An important surface modeling problem in CAD is to connect two disjoint B-spline patches with the second-order geometric continuity. In this paper we present a study to s...
Yu Zang, Yong-Jin Liu, Yu-Kun Lai