Found 6 resultsAuthor Keyword Title [ Type] Year
Filters: First Letter Of Title is B [Clear All Filters]
Better approximation algorithms for bin covering. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. :557–566.. 2001.
Beyond Code Coverage - an Approach for Test Suite Assessment and Improvement. Software Testing, Verification and Validation Workshops (ICSTW), TAIC-PART 2015, IEEE Eighth International Conference on. :1-7.. 2015.
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP. 2076:862–874.. 2001.
Buying a Constant Competitive Ratio for Paging. Algorithms –- ESA 2001. :98–108.. 2001.
Behavior of an Adaptive Self-organizing Autonomous Agent Working with Cues and Competing Concepts. Adaptive Behaviour. 2:131–160.. 1993.
Bounded Space On-Line Bin Packing: Best Is Better than First. Algorithmica. 31:115–138.. 2001.