CORC

浏览/检索结果: 共12条,第1-10条 帮助

已选(0)清除 条数/页:   排序方式:
Parallel pareto local search revisited :First experimental results on Bi-objective UBQP 会议论文
作者:  Shi, Jialong;  Zhang, Qingfu;  Derbel, Bilel;  Liefooghe, Arnaud;  Sun, Jianyong
收藏  |  浏览/下载:6/0  |  提交时间:2019/11/26
A P-Based Hybrid Evolutionary Algorithm for Vehicle Routing Problem with Time Windows 期刊论文
mathematical problems in engineering, 2014
Niu, Yunyun; He, Juanjuan; Wang, Zhongyu; Xiao, Jianhua
收藏  |  浏览/下载:3/0  |  提交时间:2015/11/13
Combined-method for designing broadband dispersion mirror based on local optimization approach and needle optimization technique 期刊论文
optik, 2014, 卷号: 125, 期号: 3, 页码: 939
作者:  Wang, Yan-zhi;  Shao, Jian-da;  Wei, Chao-yang;  Yi, Kui;  Fan, Zheng-xiu
收藏  |  浏览/下载:15/0  |  提交时间:2016/11/28
Combined-method for designing broadband dispersion mirror based on local optimization approach and needle optimization technique 期刊论文
optik, 2014, 卷号: 125, 期号: 3, 页码: 939
作者:  Wang, Yan-zhi;  Shao, Jian-da;  Wei, Chao-yang;  Yi, Kui;  Fan, Zheng-xiu
收藏  |  浏览/下载:55/0  |  提交时间:2016/11/28
An improved hybrid particle swarm optimization algorithm for fuzzy p-hub center problem 期刊论文
COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 卷号: 64, 期号: 1, 页码: 133-142
作者:  Yang, Kai[1];  Liu, Yankui[2];  Yang, Guoqing[3]
收藏  |  浏览/下载:10/0  |  提交时间:2019/12/21
Modelling and solving for ready-mixed concrete scheduling problems with time dependence 期刊论文
International Journal of Computing Science and Mathematics, 2013, 卷号: 4, 期号: 2, 页码: 163-175
作者:  Zhang, Guo-Chen;  Zeng, Jian-Chao
收藏  |  浏览/下载:32/0  |  提交时间:2020/11/14
Global descent methods for unconstrained global optimization 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2011, 卷号: 50, 页码: 379-396
作者:  Wu, Z. Y.[1];  Li, D.[2];  Zhang, L. S.[3]
收藏  |  浏览/下载:2/0  |  提交时间:2019/04/30
On complexity of unconstrained hyperbolic 0-1 programming problems 期刊论文
2010, 2010
Prokopyev, OA; Huang, HX; Pardalos, PA
收藏  |  浏览/下载:1/0
Optimal multiresolution dynamic models generation based on triangle importance (EI CONFERENCE) 会议论文
2nd International Conference on Image Analysis and Signal Processing, IASP'2010, April 12, 2010 - April 14, 2010, Xiamen, China
Zhang S.; Wu Y.; Zhao J.
收藏  |  浏览/下载:14/0  |  提交时间:2013/03/25
In this paper  we propose an efficient method to generate optimal multiresolution dynamic models. By the method  we define the triangle importance degree as a weight parameter to be embedded to the edge contraction cost  so the new metric can not only measure distance error but also reflect geometric variation of local areas. A deformation degree weight is appended to the aggregated edge contraction cost for the whole animation  thus sharp features on areas with large deformation can be preserved. In addition  a process of mesh optimization and validity check can further alleviate the geometric distortion of the approximations. Our approach is efficient in operation  easy for implementation  and as a result high quality of dynamic approximations with well-preserved fine details can be generated at any given frame. 2010 IEEE.  
A local feature based simplification method for animated mesh sequence (EI CONFERENCE) 会议论文
2010 2nd International Conference on Computer Engineering and Technology, ICCET 2010, April 16, 2010 - April 18, 2010, Chengdu, China
Zhang S.; Zhao J.; Wang B.
收藏  |  浏览/下载:21/0  |  提交时间:2013/03/25
Although animated meshes are frequently used in numerous domains  only few works have been proposed until now for simplifying such data. In this paper  we propose a new method for generating progressive animated models based on local feature analysis and deformation area preservation. We propose the use of solid angle and height value for a non-hyperbolic vertex to define the local feature parameter. This local factor is embedded to the vertex quadric error matrix when calculating the edge collapse cost. In order to preserve the areas with large deformation  we add deformation degree weight to the aggregated quadric errors when computing the unified edge contraction sequence. Finally  a mesh optimization process is proposed to further reduce the geometric distortion for each frame. Our approach is fast  easy to implement  and as a result good quality dynamic approximations with well-preserved fine details can be generated at any given frame. 2010 IEEE.  


©版权所有 ©2017 CSpace - Powered by CSpace