On Monday the 2nd of December 2019, M.Sc. Paul Saikko will defend his doctoral thesis on Implicit Hitting Set Algorithms for Constraint Optimization. The thesis is a part of research done in the ...

If you’ve ever completed a sudoku puzzle, then you’ve completed a constraint satisfaction problem (CSP). This type of problem is defined as a mathematical question where a number of constraints or ...

Tsukuba, Japan—Distributed constraint optimization problems are crucial for modeling cooperative-multiagent systems. Asynchronous Distributed OPTimization (ADOPT) is a well-known algorithm for solving ...

With the wide application of UAVs in modern operations, efficient cooperative task assignment of heterogeneous UAVs under complex constraints has become crucial for enhancing mission success rates.

This study develops an algorithmic framework for incorporating fairness constraints into sequential search problems where inspecting each candidate is costly. The framework generalizes classical ...

Automated systems trained with real-world data have a tendency to discriminate against disadvantaged groups. For instance, an algorithm adopted by the U.K. government downgraded hundreds of thousands ...