702 search results - page 6 / 141 » Identifying Graph Automorphisms Using Determining Sets |
109
Voted
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
120
Voted
AAAI
2010
15 years 3 months ago
2010
We develop a method for detecting symmetries in arbitrary games and exploiting these symmetries when using tree search to play the game. Games in the General Game Playing domain a...
112
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
119
Voted
AMAST
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Symmetry reduced model checking is hindered by two problems: how to identify state space symmetry when systems are not fully symmetric, and how to determine equivalence o...
130
Voted
CAISE
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for workflows, we show how a control flow specificati...