AI Can’t Fix the Student-Motivation Problem

But by this spring, Khan had admitted that the release of Khanmigo was “a non-event” for many kids. Although access exploded, ...
Scientific Research Publishing

Research on an Intelligent Algorithm for the Restoration of Fractured Aero Engine Wheel Disks ()

School of Power and Energy, Nanchang Hangkong University, Nanchang, China. China’s aviation industry, particularly its civil aviation sector, is undergoing rapid development, with the fleet of civil ...
IEEE

A memetic algorithm for the quadratic assignment problem with parallel local search

Abstract: The Quadratic Assignment Problem (QAP) is a well-studied, NP-Hard combinatorial optimization problem with practical applications in timetabling, scheduling, logistics, circuit design and ...
www.cs.cmu.edu

The Algorithm

In a standard paper assignment setting, a set $\mathcal{P}$ of $n^{(p)}$ papers needs to be assigned to a set $\mathcal{R}$ of $n^{(r)}$ reviewers. To ensure each ...
Frontiers

Quantum annealing research at CMU: algorithms, hardware, applications

In this mini-review, we introduce and summarize research from the Quantum Technologies Group (QTG) at Carnegie Mellon University related to computational experience with quantum annealing, performed ...
acm.org

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow

Download PDF Join the Discussion View in the ACM Digital Library The maximum flow problem and its generalization, the minimum-cost flow problem, are classic combinatorial graph problems that find ...
IEEE

An Improved Hybrid Genetic Algorithm for the Quadratic Assignment Problem

Abstract: The quadratic assignment problem (QAP) is a well-known optimization problem that has many applications in various engineering areas. Due to its NP-hard nature, rather than the exact methods, ...