1431 search results - page 148 / 287 » The complexity of random ordered structures |
114
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
110
click to vote
WSC
1998
15 years 4 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
137
click to vote
IJAR
2010
15 years 1 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
137
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
112
click to vote
BSL
2004
15 years 3 months ago
2004
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...