927 search results - page 93 / 186 » Detection of Simple Plagiarism in Computer Science Papers |
151
click to vote
ACSC
2004
IEEE
15 years 8 months ago
2004
IEEE
We have been investigating ways in which the performance of model elimination based systems can be improved and in this paper we present some of our results. Firstly, we have inve...
127
click to vote
RTA
1991
Springer
15 years 8 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
145
click to vote
ACSC
2008
IEEE
15 years 6 months ago
2008
IEEE
Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language r...
207
click to vote
MFCS
2010
Springer
15 years 2 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
127
click to vote
TCS
2010
15 years 2 months ago
2010
We consider the problem of actively learning the mean values of distributions associated with a finite number of options. The decision maker can select which option to generate t...