Sciweavers

4112 search results - page 457 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
UAI
2004
15 years 9 months ago
Compact Value-Function Representations for Qualitative Preferences
We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation foc...
Ronen I. Brafman, Carmel Domshlak, Tanya Kogan
AAAI
1998
15 years 9 months ago
Computing Intersections of Horn Theories for Reasoning with Models
We consider computational issues in combining logical knowledge bases represented by their characteristic models; in particular, we study taking their logical intersection. We pre...
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
ACL
1997
15 years 9 months ago
Document Classification Using a Finite Mixture Model
We propose a new method of classifying documents into categories. We define for each category a finite mixture model based on soft clustering of words. We treat the problem of cla...
Hang Li, Kenji Yamanishi
NIPS
2000
15 years 9 months ago
The Use of Classifiers in Sequential Inference
We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we deve...
Vasin Punyakanok, Dan Roth
CORR
2008
Springer
94views Education» more  CORR 2008»
15 years 7 months ago
Minimum Dissatisfaction Personnel Scheduling
: In this paper we consider two problems regarding the scheduling of available personnel in order to perform a given quantity of work, which can be arbitrarily decomposed into a se...
Mugurel Ionut Andreica, Romulus Andreica, Angela A...