A group of researchers at the Massachusetts Institute of Technology have devised a potentially more effective way of helping computers solve some of the toughest optimization problems they face. Their ...

DTBO is introduced based on the driving training process in which a person is trained to learn driving skills. A set of 53 objective functions is used to analyze the performance of DTBO in ...

The batch scheduling problem is a type of scheduling problem with a broad engineering background, particularly in manufacturing systems. This problem includes two subtypes: the serial batch scheduling ...

Computational biologists at the University of Toronto have developed an artificial intelligence algorithm that has the potential to create novel protein molecules as finely tuned therapeutics. Their ...

Two brothers in Singapore have built a data-encryption company on pure mathematics, betting that a problem no algorithm can ...

The algorithm works by partitioning an originally large problem into a group of subproblems. The D-Wave annealer then iteratively optimizes each subproblem to eventually solve the original larger one.

The Rubik’s Cube looks like a simple kids’ toy, but anyone who’s tried to line up the block’s colors knows how challenging it is. For experts, the current record is about three and a half seconds to ...

It used to be that bitcoin mining was a community affair, but the process of confirming bitcoin transactions now requires an immense amount of hashing power specific to the SHA-256 mining algorithm.