721 search results - page 104 / 145 » Bounds on the k-domination number of a graph |
100
click to vote
IWDC
2005
Springer
15 years 5 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
101
click to vote
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
113
click to vote
AI
2002
Springer
14 years 11 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
153
click to vote
AII
1992
15 years 3 months ago
1992
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...