4095 search results - page 602 / 819 » How to test a tree |
SYNASC
2006
IEEE
14 years 2 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
SAC
2006
ACM
14 years 2 months ago
2006
ACM
Nowadays the concept of trust in computer communications starts to get more and more popular. While the idea of trust in human interaction seems to be obvious and understandable i...
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
DIAGRAMS
2004
Springer
14 years 1 months ago
2004
Springer
A composite cluster map displays a fuzzy categorisation of geographic areas. It combines information from several sources to provide a visualisation of the significance of cluster...
EKAW
2004
Springer
14 years 1 months ago
2004
Springer
We present a tool which helps domain experts capture and maintain constraints. The tool displays parts of an ontology (as classes, sub-classes and properties) in the form of a tree...