The quest to find the longest-running simple computer program has identified a new champion. It’s physically impossible to ...

A reader explains the adaptations that let squirrels make this gravity-defying manoeuvre - which a cat could only dream of ...

We propose algorithms for performing model checking and control synthesis for discrete-time uncertain systems under linear temporal logic (LTL) specifications. We construct temporal logic trees (TLTs) ...

To efficiently retrieve exact optimal solutions, we propose an iterative-deepening A*-based tree search algorithm using admissible lower and efficient upper bound algorithms for guaranteed optimality.

Groundbreaking new research reveals something that should have been obvious all along: trees have a vast, diverse microbiome ...

This lively introductory text exposes the student in the humanities to the world of discrete mathematics. A problem-solving based approach grounded in the ideas of George Pólya are at the heart of ...

Here we study the approximation properties with rates of generalized discrete versions of Picard, Gauss–Weierstrass, and Poisson–Cauchy singular operators. We treat both the unitary and non-unitary ...