Sciweavers

110 search results - page 4 / 22
» Automatic Generator of Minimal Problem Solvers
Sort
View
FM
2008
Springer
93views Formal Methods» more  FM 2008»
13 years 10 months ago
Finding Minimal Unsatisfiable Cores of Declarative Specifications
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
Emina Torlak, Felix Sheng-Ho Chang, Daniel Jackson
PG
2003
IEEE
14 years 1 months ago
Hierarchical Least Squares Conformal Map
A texture atlas is an efficient way to represent information (like colors, normals, displacement maps ...) on triangulated surfaces. The LSCM method (Least Squares Conformal Maps...
Nicolas Ray, Bruno Lévy
CONSTRAINTS
2011
13 years 3 months ago
Dantzig-Wolfe decomposition and branch-and-price solving in G12
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...
Jakob Puchinger, Peter J. Stuckey, Mark G. Wallace...
ICAI
2004
13 years 10 months ago
Automatic Generation of English-language Steps in Puzzle Solving
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...
Hemantha Ponnuru, Raphael A. Finkel, Victor W. Mar...
CPAIOR
2008
Springer
13 years 10 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann