Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Current computer systems and communication networks tend to be highly complex, and they typically hide their internal structure from their users. Thus, for selected aspects of cap...
Thomas Begin, Alexandre Brandwajn, Bruno Baynat, B...
Traffic matrices play a pivotal role in the management of an ISP's network such as various levels of traffic engineering and capacity planning. However, it is unclear how the...
Finding an efficient configuration for cluster-based multi-tier Internet services is often a difficult task. Moreover, even a good configuration could become obsolete, depending o...