In this work, we develop a minimum action method (MAM) with optimal linear time scaling, called tMAM for short. The main idea is to relax the integration time as a functional of the transition path through optimal linear time scaling such that a direct optimization of the integration time is not required. The Feidlin-Wentzell action functional is discretized by finite elements, based on which h...

A class LT 0 of functions computable in a proper sub-class of Lintime is de ned, and formalized in a system LT0 of monadic and atomic (quanti er-free) logic. In spite of its poor computational complexity power and logical apparatus, this system has enough power to describe its own proof-predicate. Therefore it might qualify as smallest known system in which Godel-like diagonalization can be ap...

We present global and local algorithms for evaluating minimal xed points of dependency graphs, a general problem in xed-point computation and model checking. Our algorithms run in linear-time, matching the complexity of the best existing algorithms for similar problems, and are simple to understand. The main novelty of our global algorithm is that it does not use the counter and \reverse list" ...

control scheme, in which different time scales for the rigid body subsystem dynamics and for the flexible dynamics are used (Canudas de Wit et al., 1996). An application of the two-time scale method is shown, for example, in Kang, Yeung, and Mills (2002). In summary, the aim of the authors to provide an upperlevel undergraduate and graduate textbook and a reference for experienced professionals...

The recent emergence of data mining as a major application of machine learning has led to increased interest in fast rule induction algorithms. These are able to e ciently process large numbers of examples, under the constraint of still achieving good accuracy. If e is the number of examples, many rule learners have O(e 4 ) asymptotic time complexity in noisy domains, and C4.5RULES has been emp...