X
Xavier Lorca
Researcher at École des mines de Nantes
Publications - 46
Citations - 1126
Xavier Lorca is an academic researcher from École des mines de Nantes. The author has contributed to research in topics: Constraint programming & Constraint (information theory). The author has an hindex of 11, co-authored 42 publications receiving 1088 citations. Previous affiliations of Xavier Lorca include French Institute for Research in Computer Science and Automation & Centre national de la recherche scientifique.
Papers
More filters
Proceedings ArticleDOI
Entropy: a consolidation manager for clusters
TL;DR: The Entropy resource manager for homogeneous clusters is proposed, which performs dynamic consolidation based on constraint programming and takes migration overhead into account and the use of constraint programming allows Entropy to find mappings of tasks to nodes that are better than those found by heuristics based on local optimizations.
Choco: an Open Source Java Constraint Programming Library
TL;DR: Choco is a java library for constraint satisfaction problems (CSP), constraint programming (CP) and explanation-based constraint solving (e-CP), built on a event-based propagation mechanism with backtrackable structures.
Book ChapterDOI
Bin repacking scheduling in virtualized datacenters
TL;DR: This work introduces the Bin Repacking Scheduling Problem, a problem to find a final packing and to schedule the transitions from a given initial packing, accordingly to new resource and placement requirements, while minimizing the average transition completion time.
Book ChapterDOI
The tree constraint
TL;DR: An arc-consistency algorithm for the tree constraint, which enforces the partitioning of a digraph $G$ = ($\mathcal{G}$ + |V| + |E}|) into a set of vertex-disjoint anti-arborescences.
Journal ArticleDOI
Combining Tree Partitioning, Precedence, and Incomparability Constraints
TL;DR: This work describes filtering rules for this extended tree constraint and evaluates its effectiveness on three applications: the Hamiltonian path problem, the ordered disjoint paths problem, and the phylogenetic supertree problem.