14158 search results - page 346 / 2832 » Generalized switch-setting problems |
190
click to vote
SIGECOM
2011
ACM
14 years 7 months ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
154
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, an object-oriented unified optimization framework (UOF) for general problem optimization is proposed. Based on evolutionary algorithms, numerical deterministic meth...
137
click to vote
LOGCOM
2010
15 years 3 months ago
2010
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
117
click to vote
JCT
2011
14 years 11 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
134
click to vote
IPL
2000
15 years 4 months ago
2000
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...