432 citations · 625 across the 7 of their papers we have counts for
Showing 2014 · cs.AIShow all
2 papers · 2 filters
cs.AI2014★ 3 cited
On the Complexity of Optimization Problems based on Compiled NNF Representations
Daniel Le Berre, Emmanuel Lonca, Pierre Marquis
Optimization is a key task in a number of applications. When the set of feasible solutions under consideration is of combinatorial nature and described in an implicit way as a set…
cs.AI2014
Some thoughts about benchmarks for NMR
Daniel Le Berre
The NMR community would like to build a repository of benchmarks to push forward the design of systems implementing NMR as it has been the case for many other areas in AI. There ar…