16430 search results - page 81 / 3286 » On Computable Tree Functions |
124
click to vote
OPODIS
2008
15 years 4 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
CP
2005
Springer
15 years 8 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
135
click to vote
SFP
2001
15 years 4 months ago
2001
: It is well known that type constructors of incomplete trees (trees with variables) carry the structure of a monad with substitution as the extension operation. Less known are the...
ACISP
2008
Springer
15 years 9 months ago
2008
Springer
ICIP
2007
IEEE
2007
IEEE
Effective Component Tree Computation with Application to Pattern Recognition in Astronomical Imaging
15 years 9 months ago