Sciweavers

69 search results - page 7 / 14
» Nonmonotonic Commitment Machines
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Democratic approximation of lexicographic preference models
Previous algorithms for learning lexicographic preference models (LPMs) produce a "best guess" LPM that is consistent with the observations. Our approach is more democra...
Fusun Yaman, Thomas J. Walsh, Michael L. Littman, ...
ICML
2010
IEEE
13 years 6 months ago
Multiple Non-Redundant Spectral Clustering Views
Many clustering algorithms only find one clustering solution. However, data can often be grouped and interpreted in many different ways. This is particularly true in the high-dim...
Donglin Niu, Jennifer G. Dy, Michael I. Jordan
WSC
1997
13 years 8 months ago
AutoSched Tutorial
The AutoSchedTM finite capacity planning and scheduling tool helps you increase throughput, reduce in-process inventory, and increase equipment and personnel utilization. AutoSche...
Bill Lindler
ICN
2001
Springer
13 years 12 months ago
Management and Realization of SLA for Providing Network QoS
We consider an SLA (Service Level Agreement) committed between two parties to use the guarantee of QoS provided by a QoS Enabled Network (QEN). QEN can provide guarantee of QoS bec...
Manzoor Hashmani, Mikio Yoshida, Takeshi Ikenaga, ...
JMLR
2011
111views more  JMLR 2011»
13 years 2 months ago
Models of Cooperative Teaching and Learning
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...
Sandra Zilles, Steffen Lange, Robert Holte, Martin...