Sciweavers

122
Voted
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 7 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
95
Voted
APPROX
2006
Springer
114views Algorithms» more  APPROX 2006»
15 years 7 months ago
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye
CASES
2004
ACM
15 years 7 months ago
Providing time- and space- efficient procedure calls for asynchronous software thread integration
Asynchronous Software Thread Integration (ASTI) provides fine-grain concurrency in real-time threads by statically scheduling (integrating) code from primary threads into secondar...
Vasanth Asokan, Alexander G. Dean