2957 search results - page 139 / 592 » The Complexity of Polynomial-Time Approximation |
144
click to vote
FSTTCS
2010
Springer
15 years 3 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
169
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...
121
click to vote
ESANN
2007
15 years 6 months ago
2007
In the paper, the problem of multi-objective (MOBJ) learning is discussed. The problem of obtaining apparent (effective) complexity measure, which is one of the objectives, is con...
121
click to vote
APPML
2007
15 years 5 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
118
click to vote
ESANN
2007
15 years 6 months ago
2007
Abstract. Using radial basis function networks for function approximation tasks suffers from unavailable knowledge about an adequate network size. In this work, a measuring techni...