511 search results - page 87 / 103 » Using Combinatorial Optimization Methods for Quantification ... |
JAL
2006
14 years 9 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
150
click to vote
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
We present a method to evaluate path queries based on the novel concept of partial path instances. Our method (1) maximizes performance by means of sequential scans or asynchronou...
IJCAI
2001
14 years 11 months ago
2001
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
65
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form o...