1402 search results - page 76 / 281 » Searching Cycle-Disjoint Graphs |
FOIKS
2008
Springer
2008
Springer
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
14 years 11 months ago
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
AAAI
2000
14 years 11 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
DMGT
2011
14 years 1 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
ICDE
2012
IEEE
13 years 10 days ago
2012
IEEE
—There is increasing interest in analyzing networks of all types including social, biological, sensor, computer, and transportation networks. Broadly speaking, we may be interest...
EURODAC
1994
IEEE
15 years 2 months ago
1994
IEEE
Abstract -- A general framework for synthesis of asynchronous control circuits at the state graph level is proposed. The framework can consider both concurrency reduction as well a...