1736 search results - page 111 / 348 » The rank-width of Directed Graphs |
155
click to vote
ICCS
2005
Springer
15 years 9 months ago
2005
Springer
A machine learning technique for handling scenarios of interaction between conflicting agents is suggested. Scenarios are represented by directed graphs with labeled vertices (for ...
133
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
123
click to vote
CSMR
2008
IEEE
15 years 11 months ago
2008
IEEE
Databases are continuously evolving environments, where design constructs are added, removed or updated rather often. Small changes in the database configurations might impact a l...
152
click to vote
SSDBM
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
112
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...