Found 10 resultsAuthor Keyword Title [ Type] Year
Filters: First Letter Of Last Name is W [Clear All Filters]
Shelf Algorithms for On-Line Strip Packing. Inf. Process. Lett.. 63:171–175.. 1997.
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. Algorithmica. 21:104–118.. 1998.
The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett.. 11:281–287.. 1992.
On the Sum-of-squares Algorithm for Bin Packing. Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing. :208–217.. 2000.
Effective Algorithmic Debugging for Inductive Logic Programming. GMD-Studien. 237:175-194.. 1994.
Buying a Constant Competitive Ratio for Paging. Algorithms –- ESA 2001. :98–108.. 2001.
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP. 2076:862–874.. 2001.
Application of Different Learning Methods to Hungarian Part-of-Speech Tagging. Proceedings of the 9th International Workshop on Inductive Logic Programming. :128–139.. 1999.
Assessment of the Code Refactoring Dataset Regarding the Maintainability of Methods. Computational Science and Its Applications – ICCSA 2016: 16th International Conference, Beijing, China, July 4-7, 2016, Proceedings, Part IV. :610–624.. 2016.