16091 search results - page 134 / 3219 » Solving |
122
click to vote
ECTEL
2009
Springer
15 years 9 months ago
2009
Springer
The work described is part of an ongoing interdisciplinary collaboration between two research teams of the University of Patras, Greece and the University of Freiburg, Germany, whi...
108
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
108
click to vote
ESWS
2009
Springer
15 years 9 months ago
2009
Springer
The primary goal of the Semantic Web is to use URIs as a universal space to name anything, expanding from using URIs for webpages to URIs for “real objects and imaginary concepts...
126
Voted
EUROCAST
2009
Springer
15 years 9 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
120
click to vote
IMA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...