1174 search results - page 72 / 235 » Optimizing generics is easy! |
PLILP
1993
Springer
14 years 2 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
ECAI
2010
Springer
13 years 11 months ago
2010
Springer
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is a first-class citizen, and in particular can be negated and nested. There i...
CP
2009
Springer
14 years 4 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...