Sciweavers

232 search results - page 26 / 47
» Competitiveness via consensus
Sort
View
SDM
2012
SIAM
281views Data Mining» more  SDM 2012»
11 years 10 months ago
Contextual Collaborative Filtering via Hierarchical Matrix Factorization
Matrix factorization (MF) has been demonstrated to be one of the most competitive techniques for collaborative filtering. However, state-of-the-art MFs do not consider contextual...
ErHeng Zhong, Wei Fan, Qiang Yang
AAAI
2012
11 years 10 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
ICALP
2003
Springer
14 years 1 months ago
Online Load Balancing Made Simple: Greedy Strikes Back
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia...
AGENTS
2001
Springer
14 years 9 days ago
Automated negotiation from declarative contract descriptions
We present and implement an infrastructure for automating the negotiation of business contracts. Underlying our system is a declarative language for both (1) fully-specified, exe...
Daniel M. Reeves, Michael P. Wellman, Benjamin N. ...
SAC
2010
ACM
14 years 1 months ago
Chemical-inspired self-composition of competing services
This paper aims at pushing the clear relationship between software service composition and chemical dynamics a step forward. We developed a coordination model where services and c...
Mirko Viroli, Matteo Casadei