13603 search results - page 106 / 2721 » On the Computational Complexity of Cut-Reduction |
199
click to vote
DFG
1992
Springer
15 years 10 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
174
click to vote
AAAI
2004
15 years 7 months ago
2004
This paper presents a discussion of the theoretical complexity of plan recognition on the basis of an analysis of the number of explanations that any complete plan recognition alg...
145
click to vote
CJ
2008
15 years 6 months ago
2008
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...
189
click to vote
CCR
2006
15 years 6 months ago
2006
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
149
click to vote
IPL
2008
15 years 6 months ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...