881 search results - page 61 / 177 » Solving satisfiability problems with preferences |
124
click to vote
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
Ranking queries report the top-K results according to a user-defined scoring function. A widely used scoring function is the weighted summation of multiple scores. Often times, u...
101
click to vote
MASCOTS
2007
15 years 4 months ago
2007
Abstract— Wireless Mesh Networks are a scalable and costeffective solution for next-generation wireless networking. In the present work, we consider the Round Weighting Problem (...
119
click to vote
DISOPT
2008
15 years 3 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
120
click to vote
JCNS
2010
14 years 9 months ago
2010
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
142
click to vote
AMEC
2003
Springer
15 years 8 months ago
2003
Springer
Digital information economies require information goods producers to learn how to position themselves within a potentially vast product space. Further, the topography of this spac...