13603 search results - page 403 / 2721 » On the Complexity of Computing Treelength |
245
click to vote
KSEM
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper, we compare merging operators in possibilistic logic. We first propose an approach to evaluating the discriminating power of a merging operator. After that...
182
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...
206
click to vote
PARA
2000
Springer
15 years 11 months ago
2000
Springer
The JavaGrande Forum is a group of users, researchers, and interested parties from industry. The Forum members are either trying to use Java for resource-intensive applications or ...
175
click to vote
DEXAW
2003
IEEE
16 years 27 days ago
2003
IEEE
Increasing hardware performance of desktop computers accounts for a low-cost computing potential that is waiting to be efficiently used. However, the complexity of installation a...
240
click to vote
ATC
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. To overcome increasing complexity and dynamic nature of distributed computing system, such as ubiquitous computing systems, it is critical to have computing systems that ...