Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
—In some applications, the probability of error of a given classifier is too high for its practical application, but we are allowed to gather more independent test samples from ...
Studying image intensity change in each pixel in dynamic contrast enhanced (DCE)-MRI data enables differentiation of different tissue types based on their difference in contrast u...
Hatef Mehrabian, Ian Pang, Chaitanya Chandrana, Ra...