688 search results - page 51 / 138 » Comparison of Conceptual Graphs |
159
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
In many applications it is important to find a meaningful relationship between the schemas of a source and target database. This relationship is expressed in terms of declarative ...
KR
2010
Springer
15 years 2 months ago
2010
Springer
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules have t...
PPAM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
WEA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...