This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
The hybrid system of personalized product recommendation in e-commerce, by integrating various methods, was presented in the paper. Each e-commerce user has assigned their own wei...
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....
This paper presents a new instructional operating system, OS/161, and simulated execution environment, System/161, for use in teaching an introductory undergraduate operating syst...
The paper investigates discourse particles on the example of German doch, assigning to them very specific semantic interpretations that still cover a wide range of their uses. The...