Sciweavers

881 search results - page 61 / 177
» Solving satisfiability problems with preferences
Sort
View
SIGMOD
2011
ACM
234views Database» more  SIGMOD 2011»
12 years 11 months ago
Ranking with uncertain scoring functions: semantics and sensitivity measures
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...
Mohamed A. Soliman, Ihab F. Ilyas, Davide Martinen...
MASCOTS
2007
13 years 10 months ago
Multiobjective Analysis in Wireless Mesh Networks
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 (...
Cristiana Gomes, Gurvan Huiban
DISOPT
2008
107views more  DISOPT 2008»
13 years 8 months ago
The k-path tree matroid and its applications to survivable network design
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...
Esther M. Arkin, Refael Hassin
JCNS
2010
103views more  JCNS 2010»
13 years 3 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
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...
Shinsuke Koyama, Liam Paninski
AMEC
2003
Springer
14 years 2 months ago
Improving Learning Performance by Applying Economic Knowledge
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...
Christopher H. Brooks, Robert S. Gazzale, Jeffrey ...