526 search results - page 38 / 106 » Improved Decomposition of STGs |
SIGIR
2011
ACM
13 years 21 days ago
2011
ACM
Traditional recommendation algorithms often select products with the highest predicted ratings to recommend. However, earlier research in economics and marketing indicates that a ...
ATAL
2011
Springer
12 years 10 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
CEC
2009
IEEE
14 years 4 months ago
2009
IEEE
—In this paper, the DMOEA-DD, which is an improvement of DMOEA[1, 2] by using domain decomposition technique, is applied to tackle the CEC 2009 MOEA competition test instances th...
FOCS
1991
IEEE
14 years 1 months ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
CAD
2005
Springer
13 years 9 months ago
2005
Springer
This paper presents a new and efficient algorithm for the decomposition of 3D arbitrary triangle meshes and particularly optimized triangulated CAD meshes. The algorithm is based ...