192 search results - page 36 / 39 » On Graph Isomorphism for Restricted Graph Classes |
AI
2007
Springer
14 years 11 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
PEPM
2007
ACM
15 years 5 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
105
click to vote
ICSE
2000
IEEE-ACM
15 years 3 months ago
2000
IEEE-ACM
This paper proposes to use SDL block diagrams, UML class diagrams, and UML behavior diagrams like collaboration diagrams, activity diagrams, and statecharts as a visual programmin...
DAC
1995
ACM
15 years 3 months ago
1995
ACM
— Software components for embedded reactive real-time applications must satisfy tight code size and runtime constraints. Cooperating finite state machines provide a convenient i...