2957 search results - page 486 / 592 » The Complexity of Polynomial-Time Approximation |
EPIA
2007
Springer
14 years 2 months ago
2007
Springer
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
FSTTCS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
IPSN
2007
Springer
14 years 1 months ago
2007
Springer
Energy-efficient image communication is one of the most important goals for a large class of current and future sensor network applications. This paper presents a quantitative com...
MICAI
2007
Springer
14 years 1 months ago
2007
Springer
Instance-based learning algorithms are widely used due to their capacity to approximate complex target functions; however, the performance of this kind of algorithms degrades signi...