2899 search results - page 545 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
104
click to vote
JALC
2007
15 years 1 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
160
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: The responses to interleukin 1 (IL-1) in human chondrocytes constitute a complex regulatory mechanism, where multiple transcription factors interact combinatorially to...
132
click to vote
JSAC
2007
15 years 1 months ago
2007
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
122
click to vote
SIAMCOMP
2002
15 years 1 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
116
click to vote
LATIN
2010
Springer
14 years 11 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...