2266 search results - page 307 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
179
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
188
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
The concept of neighbor system, introduced by Hartvigsen (2009), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship...
153
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
214
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
197
click to vote
GECCO
1999
Springer
15 years 11 months ago
1999
Springer
In this paper, we apply an evolutionary algorithm to learning behavior on a novel, interesting task to explore the general issue of learning e ective behaviors in a complex enviro...