We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori...
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...