The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
— This paper describes our efforts in building an experimental platform to conduct research on cooperative driving in Intelligent Transportation Systems (ITS). A miniature vehicl...
— We study radio signal propagation in indoor environments using low-power devices leveraging the Zigbee and Bluetooth specifications. We present results from experiments where ...
Jonathan Fink, Nathan Michael, Aleksandr Kushleyev...
Effective communication and coordination across multiple sites is extremely important for global software development. An experimental simulation that mimics an interdependent sof...
N. Sadat Shami, Nathan Bos, Zach Wright, Susannah ...
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...