Sciweavers

689 search results - page 57 / 138
» A Modal-Logic Based Graph Abstraction
Sort
View
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
14 years 1 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
EUROPAR
2004
Springer
14 years 1 months ago
Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
Ondrej Medek, Pavel Tvrdík, Jaroslav Kruis
IAT
2009
IEEE
13 years 11 months ago
Efficient Distributed Bayesian Reasoning via Targeted Instantiation of Variables
Abstract--This paper is focusing on exact Bayesian reasoning in systems of agents, which represent weakly coupled processing modules supporting collaborative inference through mess...
Patrick de Oude, Gregor Pavlin
GD
2006
Springer
13 years 11 months ago
Integrating Edge Routing into Force-Directed Layout
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
Tim Dwyer, Kim Marriott, Michael Wybrow
ECAI
2000
Springer
13 years 11 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon