194 search results - page 33 / 39 » Tabular Constraint-Satisfaction Problems and Answer Set Prog... |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
KR
2010
Springer
15 years 2 months ago
2010
Springer
We present a distributed algorithm for computing equilibria of heterogeneous nonmonotonic multi-context systems (MCS). The algorithm can be parametrized to compute only partial eq...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Given linear matrix inequalities (LMIs) L1 and L2 in the same number of variables it is natural to ask: (Q1) does one dominate the other, that is, does L1(X) 0 imply L2(X) 0? (Q2) ...
106
click to vote
CEC
2011
IEEE
13 years 9 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
COCO
1995
Springer
15 years 1 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...