37 search results - page 3 / 8 » arc 2011 |
CP
2011
Springer
12 years 5 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
ECSA
2011
Springer
12 years 5 months ago
2011
Springer
Modeling of software architectures is a fundamental part of software development processes. Reuse of software components and early analysis of software topologies allow the reduct...
JSYML
2011
13 years 7 days ago
2011
Abstract. This paper introduces a natural extension of Kolchin’s differential Galois theory to positive characteristic iterative differential fields, generalizing to the non-li...
AIPS
2011
12 years 9 months ago
2011
In recent years, there has been considerable interest in the use of planning techniques in new media and computer games. Many traditional planning notions no longer apply in the c...