Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
There is an increasing amount of structure on the Web as a result of modern Web languages, user tagging and annotation, and emerging robust NLP tools. These meaningful, semantic, ...
— Many architectures have been proposed to solve tightly-coupled multirobot tasks (MT) through coalitions of heterogeneous robots. However, several issues remain unaddressed. As ...
This paper outlines a series of experiments to develop asynchronous messaging systems for preschool aged children. Three unique systems build on a foundational design called Toast...
Hayes Raffle, Rafael Ballagas, Glenda Revelle, Koi...
Abstract. This paper addresses a problem arising in the reverse engineering of solid models from depth-maps. We wish to identify and fit surfaces of known type wherever these are a...