1199 search results - page 88 / 240 » Graph Theory |
133
click to vote
ICTAC
2004
Springer
15 years 9 months ago
2004
Springer
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
118
click to vote
DAGSTUHL
2008
15 years 5 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
154
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
130
Voted
AAAI
1990
15 years 5 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
131
Voted
SAC
2009
ACM
15 years 10 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...