The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct comp...
Wolfgang W. Bein, Lawrence L. Larmore, John Noga, ...
TON: Curve Network Abstraction for 3D Shapes Fernando de Goesa,∗ , Siome Goldensteinb , Mathieu Desbruna , Luiz Velhoc aCalifornia Institute of Technology, Pasadena, CA 91125, US...
Fernando de Goes, Siome Goldenstein, Mathieu Desbr...
We present new insights into how to achieve higher frequencies in large-scale nonlinear predictive control using truncated-like schemes. The basic idea is that, instead of solving ...
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...