13306 search results - page 369 / 2662 » Theoretical Computer Science |
122
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
176
click to vote
RTA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
166
click to vote
ITICSE
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we describe the use of some cooperative learning methodology sessions in a Project Based Learning course, in order to cover those topics uncovered by the project. C...