Sciweavers

2925 search results - page 88 / 585
» Information Complexity of Online Problems
Sort
View
AAAI
1990
15 years 7 months ago
The Complexity of Closed World Reasoning and Circumscription
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
Marco Cadoli, Maurizio Lenzerini
SIGIR
2004
ACM
15 years 11 months ago
A joint framework for collaborative and content filtering
This paper proposes a novel, unified, and systematic approach to combine collaborative and content-based filtering for ranking and user preference prediction. The framework inco...
Justin Basilico, Thomas Hofmann
ISCIS
2005
Springer
15 years 11 months ago
An Investigation of the Course-Section Assignment Problem
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
Zeki Bayram
DIS
2004
Springer
15 years 11 months ago
Privacy Problems with Anonymized Transaction Databases
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In...
Taneli Mielikäinen
ICGA
1997
103views Optimization» more  ICGA 1997»
15 years 7 months ago
Genetic Algorithm for Restrictive Channel Routing Problem
This paper presents a genetic algorithm for the restrictive channel routing problem. The major difference of the algorithm from already known genetic algorithms for this problem c...
Vladimir N. Davidenko, Victor M. Kureichik, Victor...