635 search results - page 31 / 127 » Some Computational Problems Related to Pseudo-intents |
122
click to vote
FTDCS
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper identifies two paradigms that influence the design of telematics systems nowadays: the protocol-centred and the object-centred paradigm. Both paradigms have been intr...
COMGEO
2006
ACM
14 years 9 months ago
2006
ACM
We consider combinatorial and computational issues that are related to the problem of moving coins from one configuration to another. Coins are defined as non-overlapping discs, an...
FROCOS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
CIE
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
178
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
We study finding similar or diverse solutions of a given computational problem, in answer set programming, and introduce offline methods and online methods to compute them using an...