and G¨ unter Schmidt

Given that recommender systems have traditionally been evaluated offline, this poses an interesting challenge in terms of algorithm effi- ciency, tracking users, building quality

In particular, methods that use a finite element simulation to compute the inverse kinematics of deformable needle (denoted here as inverse finite element method I-FEM) have been

In such context, which is in fact an online vehicle routing problem, which decisions lead to a minimal expected number of rejected requests.. Another problem is the one of police

Figure (fV-10): Champ de déformation circonférentielle pour différentes valeurs de R (critère quadratique de Hill) et pour k4.2 (critère de Drucker) (ABAQUSruMAT). IY

Computing the q- intersection is a combinatorial problem that allows us to han- dle robust parameter estimation with a numerical constraint programming approach.. The q-intersection

We presented an extension of the strategy improvement algorithm of Gawlitza and Seidl [17, 18, 21] which enables us to use a SAT modulo real linear arithmetic solver for

In this paper, we prove that one can decide in polynomial time which player has a winning strategy on loopless trees of depth at most 2 (we consider that a tree reduced to a