Sciweavers

26354 search results - page 284 / 5271
» How we refactor, and how we know it
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 12 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
AAAI
2010
15 years 8 months ago
Stackelberg Voting Games: Computational Aspects and Paradoxes
We consider settings in which voters vote in sequence, each voter knows the votes of the earlier voters and the preferences of the later voters, and voters are strategic. This can...
Lirong Xia, Vincent Conitzer
TON
2010
221views more  TON 2010»
15 years 1 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
SSPR
2000
Springer
15 years 10 months ago
A Framework for Classifier Fusion: Is It Still Needed?
We consider the problem and issues of classifier fusion and discuss how they should be reflected in the fusion system architecture. We adopt the Bayesian viewpoint and show how thi...
Josef Kittler
ISRR
2005
Springer
154views Robotics» more  ISRR 2005»
16 years 7 days ago
Session Overview Planning
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
Nicholas Roy, Roland Siegwart