Novel adaptive branching constraint solving algorithm with look-ahead strategy
Based on the state-of-the-art scheme of adaptive branching constraint solving, a novel algorithm named AdaptBranch<sup>LVO</sup>was proposed, combined with the look-ahead value ordering heuristics. To demonstrate the efficiency of AdaptBranch<sup>LVO</sup>, sufficient experim...
Saved in:
Main Authors: | Hai-yan WANG, YANGDan-tong OU, Yong-gang ZHANG, Liang ZHANG |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2013-06-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436X.2013.06.012/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
STUDY ON THE CRACK BRANCHING BEHAVIOR DURING CRACK PROPAGATION INFLUENCED BY CONSTRAINT
by: ZHANG XuDong, et al.
Published: (2022-01-01) -
Delay constraint supported overlay multicast routing protocol
by: WU Jia-gao, et al.
Published: (2005-01-01) -
Improved ant colony optimization algorithm for solving constraint satisfaction problem
by: HANGYong-gang Z, et al.
Published: (2015-05-01) -
A Novel Hyper-Heuristic Algorithm with Soft and Hard Constraints for Causal Discovery Using a Linear Structural Equation Model
by: Yinglong Dang, et al.
Published: (2025-01-01) -
Gradient formulae for probability functions depending on a heterogenous family of constraints
by: van Ackooij, Wim, et al.
Published: (2021-08-01)