446 search results - page 82 / 90 » A Combinatorial Theorem for Trees |
85
Voted
DAM
2008
14 years 9 months ago
2008
We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main con...
IJRR
2010
14 years 8 months ago
2010
This paper explores a topological perspective of planning in the presence of uncertainty, focusing on tasks specified by goal states in discrete spaces. The paper introduces stra...
CADE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
CADE
2002
Springer
15 years 9 months ago
2002
Springer
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
85
Voted
ICPP
2005
IEEE
15 years 3 months ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...