Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Ming-Yang Kao, Ming-Yang Kao
5939  Ergebnisse:
Personensuche X
?
1

Optimal Broadcast in All-Port Wormhole-Routed Hypercubes:

, In: 1994 International Conference on Parallel Processing Vol. 3,
Ching-Tien Ho, Ching-Tien Ho ; Ming-Yang Kao, Ming-Yang Kao - p. None , 1994
Link: https://doi.org/10.1109/..
 
?
2

Optimal search for parameters in Monte Carlo simulation for..:

Wang, Chuan-Ju ; Kao, Ming-Yang
European Journal of Operational Research.  249 (2016)  2 - p. 683-690 , 2016
Link: https://doi.org/10.1016/..
 
?
3

A manually-checkable proof for the NP-hardness of 11-color ..:

Johnsen, Aleck ; Kao, Ming-Yang ; Seki, Shinnosuke
Journal of Combinatorial Optimization.  33 (2015)  2 - p. 496-529 , 2015
Link: https://doi.org/10.1007/..
 
?
4

Deterministic polynomial-time algorithms for designing shor..:

Kao, Ming-Yang ; Leung, Henry C.M. ; Sun, He.
Theoretical Computer Science.  494 (2013)  - p. 144-160 , 2013
Link: https://doi.org/10.1016/..
 
?
5

Discovering almost any hidden motif from multiple sequences:

Fu, Bin ; Kao, Ming-Yang ; Wang, Lusheng
ACM Transactions on Algorithms (TALG).  7 (2011)  2 - p. 1-18 , 2011
Link: https://dl.acm.org/doi/1..
 
?
6

Discovering almost any hidden motif from multiple sequences:

Fu, Bin ; Kao, Ming-Yang ; Wang, Lusheng
ACM Transactions on Algorithms.  7 (2011)  2 - p. 1-18 , 2011
Link: https://doi.org/10.1145/..
 
?
7

Probabilistic Analysis of a Motif Discovery Algorithm for M..:

Fu, Bin ; Kao, Ming-Yang ; Wang, Lusheng
SIAM Journal on Discrete Mathematics.  23 (2010)  4 - p. 1715-1737 , 2010
Link: https://doi.org/10.1137/..
 
?
8

WITHDRAWN: A 6-approximation algorithm for computing the le..:

Kao, Ming-Yang ; Li, Xiang-Yang ; Wang, Weizhao
Theoretical Computer Science.  , 2010
Link: https://doi.org/10.1016/..
 
?
9

On approximating four covering and packing problems:

Ashley, Mary ; Berger-Wolf, Tanya ; Berman, Piotr...
Journal of Computer and System Sciences.  75 (2009)  5 - p. 287-302 , 2009
Link: https://doi.org/10.1016/..
 
?
10

Randomized fast design of short DNA words:

Kao, Ming-Yang ; Sanghi, Manan ; Schweller, Robert
ACM Transactions on Algorithms (TALG).  5 (2009)  4 - p. 1-24 , 2009
Link: https://dl.acm.org/doi/1..
 
?
11

Linear-Time Haplotype Inference on Pedigrees without Recomb..:

Chan, Mee Yee ; Chan, Wun-Tat ; Chin, Francis Y. L...
SIAM Journal on Computing.  38 (2009)  6 - p. 2179-2197 , 2009
Link: https://doi.org/10.1137/..
 
?
12

Randomized fast design of short DNA words:

Kao, Ming-Yang ; Sanghi, Manan ; Schweller, Robert
ACM Transactions on Algorithms.  5 (2009)  4 - p. 1-24 , 2009
Link: https://doi.org/10.1145/..
 
?
13

An approximation algorithm for a bottleneck traveling sales..:

Kao, Ming-Yang ; Sanghi, Manan
Journal of Discrete Algorithms.  7 (2009)  3 - p. 315-326 , 2009
Link: https://doi.org/10.1016/..
 
?
14

Encyclopedia of algorithms:

Kao, Ming-Yang , 2008
Link: http://dx.doi.org/10.100..

Exemplar:  Zentrale:E02 h inf 430 b/793
 
?
15

Boolean Satisfiability:

, In: Encyclopedia of Algorithms,
Kao, Ming-Yang - p. 97-97 , 2008
Link: https://doi.org/10.1007/..
 
1-15