Sciweavers

3338 search results - page 145 / 668
» Assigning Papers to Referees
Sort
View
DISOPT
2006
101views more  DISOPT 2006»
15 years 6 months ago
Greedy-type resistance of combinatorial problems
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...
Gareth Bendall, François Margot
IJCSA
2006
92views more  IJCSA 2006»
15 years 6 months ago
Personalized Integration of Recommendation Methods for E-commerce
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...
Przemyslaw Kazienko, Pawel Kolodziejski
JAL
2000
82views more  JAL 2000»
15 years 5 months ago
New Upper Bounds for Maximum Satisfiability
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....
Rolf Niedermeier, Peter Rossmanith
SIGCSE
2002
ACM
192views Education» more  SIGCSE 2002»
15 years 5 months ago
A new instructional operating system
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...
David A. Holland, Ada T. Lim, Margo I. Seltzer
SIGDIAL
2010
15 years 3 months ago
A unified account of the semantics of discourse particles
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...
Markus Egg