8496 search results - page 155 / 1700 » Problem Solving and Complex Systems |
154
click to vote
JMM2
2007
15 years 6 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
153
click to vote
ECCC
2007
15 years 6 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
173
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
184
click to vote
DATE
2005
IEEE
15 years 11 months ago
2005
IEEE
Complex real-time control system is a software dense and algorithms dense system, which needs modern software engineering techniques to design. UML is an object-oriented industria...
185
click to vote
LATA
2009
Springer
16 years 25 days ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...