The extent to which linear problems have linear optimal algorithms
The passing of a rational expression to a nondeterministic finite automaton. (Passage d'une expression rationnelle à un automate fini non-déterministe.)
The second machine class 2, an encyclopedic view on the parallel computation thesis
Time–dependent Simple Temporal Networks: Properties and Algorithms
Simple Temporal Networks (STN) allow conjunctions of minimum and maximum distance constraints between pairs of temporal positions to be represented. This paper introduces an extension of STN called Time–dependent STN (TSTN), which covers temporal constraints for which the minimum and maximum distances required between two temporal positions x and y are not necessarily constant but may depend on the assignments of x and y. Such constraints are useful to model problems in which the duration of an...