2 citations · 3 across the 6 of their papers we have counts for
6 papers
Optimizing
Tristan Cazenave, Swann Legras, Véronique Ventos
is a search algorithm which repairs two defaults of Perfect Information Monte Carlo search: strategy fusion and non locality. In this paper we optimize for the game of Br…
Construction and Elicitation of a Black Box Model in the Game of Bridge
Véronique Ventos, Daniel Braun, Colin Deheeger +7
We address the problem of building a decision model for a specific bidding situation in the game of Bridge. We propose the following multi-step methodology i) Build a set of exampl…
The αμ Search Algorithm for the Game of Bridge
Tristan Cazenave, Véronique Ventos
αμ is an anytime heuristic search algorithm for incomplete information games that assumes perfect information for the opponents. αμ addresses the strategy fusion and non-locality p…
Bijections between affine hyperplane arrangements and valued graphs
Sylvie Corteel, David Forge, Véronique Ventos
We show new bijective proofs of previously known formulas for the number of regions of some deformations of the braid arrangement, by means of a bijection between the no-broken-cir…
An elementary chromatic reduction for gain graphs and special hyperplane arrangements
Pascal Berthome, Raul Cordovil, David Forge +2
A gain graph is a graph whose edges are labelled invertibly by "gains" from a group. "Switching" is a transformation of gain graphs that generalizes conjugation in a group. A "weak…
Logical settings for concept learning from incomplete examples in First Order Logic
Dominique Bouthinon, Henry Soldano, Véronique Ventos
We investigate here concept learning from incomplete examples. Our first purpose is to discuss to what extent logical learning settings have to be modified in order to cope with da…