Sciweavers

74 search results - page 6 / 15
» On Programs with Linearly Ordered Multiple Preferences
Sort
View
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 7 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
SIGIR
2006
ACM
14 years 1 months ago
Large scale semi-supervised linear SVMs
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...
Vikas Sindhwani, S. Sathiya Keerthi
NETWORKING
2004
13 years 8 months ago
Distributed Scheduling of Recording Tasks with Interconnected Servers
We consider a system with multiple interconnected video servers storing TV programs that are received through satellite antennas. Users, equipped with set-top boxes, submit request...
Sergios Soursos, George D. Stamoulis, Theodoros Bo...
ASP
2003
Springer
14 years 22 days ago
Implementing OCLP as a front-end for Answer Set Solvers: From Theory to Practice
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
Martin Brain, Marina De Vos
IJCAI
2007
13 years 9 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein