Showing cs.DMShow all
2 papers · 1 filter
cs.DM2005
On Searching a Table Consistent with Division Poset
Yongxi Cheng, Xi Chen, Yiqun Lisa Yin
Suppose is a partially ordered set with the partial order defined by divisibility, that is, for any two distinct elements satisfying divides $j…
cs.DM2001
Optimal Constructions of Hybrid Algorithms
Ming-Yang Kao, Yuan Ma, Michael Sipser +1
We study on-line strategies for solving problems with hybrid algorithms. There is a problem Q and w basic algorithms for solving Q. For some lambda <= w, we have a computer with la…