Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
— Recent results on the control of linear systems subject to time-domain constraints could only handle the case of closed-loop poles that are situated on the real axis. As most c...
Wouter H. T. M. Aangenent, W. P. M. H. Heemels, M....
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
Workload characterization involves the understanding of the relationship between workload configurations and performance characteristics. To better assess the complexity of worklo...
Richard M. Yoo, Han Lee, Kingsum Chow, Hsien-Hsin ...
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...