Sciweavers

2725 search results - page 82 / 545
» Constraint Solving for Interpolation
Sort
View
138
Voted
IJCAI
1989
15 years 4 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran
156
Voted
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
15 years 2 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
157
Voted
INFORMS
1998
150views more  INFORMS 1998»
15 years 3 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
133
Voted
GECCO
2005
Springer
133views Optimization» more  GECCO 2005»
15 years 9 months ago
Heuristic rules embedded genetic algorithm to solve in-core fuel management optimization problem
Because of the large number of possible combinations for the fuel assembly loading in the core, the design of the loading pattern (LP) is a complex optimization problem. It requir...
Fatih Alim, Kostadin Ivanov
166
Voted
AIA
2006
15 years 5 months ago
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
Benno Stein, Oliver Niggemann, Theodor Lettmann