Sciweavers

55 search results - page 5 / 11
» 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
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, ...
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
DATE
2004
IEEE
184views Hardware» more  DATE 2004»
13 years 11 months ago
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
Panagiotis Manolios, Sudarshan K. Srinivasan