( en | de | ru )

 

Disambiguation of "Dinh, Hang"

Author of the publication

copydeleteadd this publication to your clipboard
The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces.

, , , and . J. Artif. Intell. Res., (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thuy-Hang Dinh

Hang Xu

Hang Si

Hang Li

In vivo analysis of leukocyte transmigration through the blood vessel wall. Uni Münster, (2009)

Tam Dinh Thi'

 

Other publications of authors with the same name

The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks, , and . CoRR, (2010)The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces., , , and . J. Artif. Intell. Res., (2012)Inconsistency versus Accuracy of Heuristics.. Canadian AI, volume 8436 of Lecture Notes in Computer Science, page 71-82. Springer, (2014)Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems, , and . CoRR, (2011)McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks., , and . CRYPTO, volume 6841 of Lecture Notes in Computer Science, page 761-779. Springer, (2011)On Achievable Rate and Ergodic Capacity of OAF Multiple-Relay Networks with CSI., , , , and . VTC Spring, page 1-6. IEEE, (2013)Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs., and . APPROX-RANDOM, volume 5171 of Lecture Notes in Computer Science, page 385-401. Springer, (2008)Quantum and randomized lower bounds for local search on vertex-transitive graphs., and . Quantum Inf. Comput., 10 (7&8): 636-652 (2010)Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints., and . Comput. Appl. Math., (December 2022)On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics., , and . AAAI, page 1140-1145. AAAI Press, (2007)