526 search results - page 38 / 106 » Improved Decomposition of STGs |
193
click to vote
SIGIR
2011
ACM
14 years 7 months 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 ...
170
click to vote
ATAL
2011
Springer
14 years 4 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...
122
click to vote
CEC
2009
IEEE
15 years 11 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...
124
click to vote
FOCS
1991
IEEE
15 years 7 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 + √ ...
161
click to vote
CAD
2005
Springer
15 years 4 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 ...