13603 search results - page 178 / 2721 » On the Complexity of Computing Treelength |
129
click to vote
FLAIRS
1998
15 years 5 months ago
1998
In somecomplexdomains,like the gameof Go,evaluating a position is not simple. In other games,like Chessfor example,material balancegives goodandfast to compute insight onthe value...
150
click to vote
CAE
2007
15 years 6 months ago
2007
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
101
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
An answer to a query has a well-defined lineage expression (alternatively called how-provenance) that explains how the answer was derived. Recent work has also shown how to comput...
133
click to vote
ICCSA
2007
Springer
15 years 10 months ago
2007
Springer
Ubiquitous multimedia services are emerging to be available at anytime and anywhere using a variety of computing devices. In this paper, we propose a low-complexity unequal loss pr...
113
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...