4934 search results - page 116 / 987 » complexity 2008 |
116
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
138
click to vote
GLOBECOM
2008
IEEE
15 years 5 months ago
2008
IEEE
—In this paper, we present a near ML-achieving sphere search technique that reduces the number of search operations significantly over existing sphere decoding (SD) algorithms. ...
133
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
114
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this chapter, we propose a new practical codification of the elements of the Venn diagram in order to easily manipulate the focal elements. In order to reduce the complexity, t...