The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
— We explore the use of computational optimal control techniques for automated construction of policies in complex dynamic environments. Our implementation of dynamic programming...
Mike Stilman, Christopher G. Atkeson, James Kuffne...
Project management involves various sources of uncertainty that affect planning, execution schedules, and cost. At the same time, the influx of information can be employed to redu...
Ivan Ourdev, Simaan M. AbouRizk, Mohammed Al-Batai...
A new augmented reality apparatus was evaluated. The device uses scanned infrared and visible lasers to project computer generated information such as surgical plans, entry pints f...
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...