Sciweavers

11345 search results - page 1801 / 2269
» Foundations of Computer Science
Sort
View
STACS
2009
Springer
15 years 11 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
STACS
2009
Springer
15 years 11 months ago
On Approximating Multi-Criteria TSP
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
Bodo Manthey
STACS
2009
Springer
15 years 11 months ago
Economical Caching
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
Matthias Englert, Heiko Röglin, Jacob Spö...
STACS
2009
Springer
15 years 11 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
CSE
2009
IEEE
15 years 11 months ago
On the Design of a Suitable Hardware Platform for Protocol Stack Processing in LTE Terminals
—In this paper we present a design methodology for the identification and development of a suitable hardware platform (including dedicated hardware accelerators) for the data pl...
Sebastian Hessel, David Szczesny, Shadi Traboulsi,...
« Prev « First page 1801 / 2269 Last » Next »