2612 search results - page 472 / 523 » Switching Graphs and Their Complexity |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
IJAR
2008
13 years 8 months ago
2008
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
IAJIT
2006
13 years 8 months ago
2006
: Deoxyribonucleic Acid or DNA-based computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. This research are...
COMBINATORICS
2007
13 years 8 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
JAIR
2008
13 years 8 months ago
2008
Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts based on base...