aDepartment of Medicine, University of California San Francisco, San Francisco, CA, USA bDepartment of Medicine, University of California Los Angeles, Los Angeles, CA, USA cDepartment of Medicine, ...

The area of approximation algorithms is aimed at giving provable guarantees on the performance of heuristics for hard problems. The course will present general techniques (such as convex ...

Professor of Management Science Associate Dean for Research and Innovation Maria Paola Scaparra is a Professor of Management Science and a member of the Centre for Logistics and Heuristic Optimisation ...

The goal of the course is to improve programming and problem-solving skills of the students by facing them with difficult problems and by presenting the techniques that help their reasoning in the ...

The slime mould algorithm (SMA) is a new swarm intelligence algorithm inspired by the oscillatory behavior of slime moulds during foraging. Numerous researchers have widely applied the SMA and its ...

Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...

We introduce the Fast Algorithm for Motion Correction (FALCON) software, which allows correction of both rigid and nonlinear motion artifacts in dynamic whole-body (WB) images, irrespective of the PET ...

It’s a tribute to journalists’ vanity and self-mythologization that the Pulitzer Prizes still retain some aura of gravitas. Having chronicled them extensively for Columbia Journalism School, I think ...

We consider the problem of joint beamforming and discrete motion control for mobile relaying networks in dynamic channel environments. We assume a single source-destination communication pair. We ...