6575 search results - page 136 / 1315 » Specializing visualization algorithms |
166
click to vote
AE
2005
Springer
15 years 12 months ago
2005
Springer
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
144
click to vote
ISCOPE
1998
Springer
15 years 10 months ago
1998
Springer
The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating ll-reducing orderings for sparse, symmetric positive de n...
179
click to vote
VECPAR
2000
Springer
15 years 10 months ago
2000
Springer
A parallel implementation of the specialized interior-point algorithm for multicommodity network flows introduced in [5] is presented. In this algorithm, the positive definite syst...
172
click to vote
ANSS
1991
IEEE
15 years 10 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
184
click to vote
VMV
2003
15 years 7 months ago
2003
There are many nearest neighbor algorithms tailormade for ICP, but most of them require special input data like range images or triangle meshes. We focus on efficient nearest nei...