We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
Noga Alon, Richard Beigel, Simon Kasif, Steven Rud...
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
For m-input, m-output, finite-dimensional, linear systems satisfying the classical assumptions of adaptive control (i.e., (i) minimum phase, (ii) relative degree one and (iii) pos...
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministi...