10271 search results - page 582 / 2055 » Computer Science |
171
click to vote
IFIP
1997
Springer
15 years 11 months ago
1997
Springer
: National and international standards for professional groups may become a dominant and governing force as internet-based professional training becomes universally accepted. Educa...
181
click to vote
EDBTW
2006
Springer
15 years 10 months ago
2006
Springer
This paper is a critical analysis of the concept of ontology thus as it is used in computing science. It identifies three main problems with such a concept, two of which are intri...
128
click to vote
STACS
2010
Springer
16 years 2 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...
210
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
184
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...