16430 search results - page 679 / 3286 » On Computable Tree Functions |
181
click to vote
CPAIOR
2005
Springer
16 years 24 days ago
2005
Springer
Hybrid algorithms combining local and systematic search often use nondeterminism in fundamentally different ways. They may differ in the strategy to explore the search tree and/o...
172
click to vote
FCT
2005
Springer
16 years 23 days ago
2005
Springer
: In this paper, we investigate the problem to find an acyclic subhypergraph in a given hypergraph, which is an extension to find a tree in a graph. First, we introduce a spannin...
180
click to vote
DSOM
2004
Springer
16 years 19 days ago
2004
Springer
Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate...
179
click to vote
FOSSACS
2004
Springer
16 years 19 days ago
2004
Springer
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
158
click to vote
GD
2004
Springer
16 years 19 days ago
2004
Springer
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...