4843 search results - page 807 / 969 » The Shortcut Problem - Complexity and Approximation |
96
Voted
ICTIR
2009
Springer
15 years 10 months ago
2009
Springer
We review the history of modeling score distributions, focusing on the mixture of normal-exponential by investigating the theoretical as well as the empirical evidence supporting i...
102
click to vote
SEMWEB
2009
Springer
15 years 10 months ago
2009
Springer
This paper suggests appropriate rules to set up ontology matching evaluations and for golden standard construction and use which can significantly improve the quality of the preci...
125
click to vote
SPIN
2009
Springer
15 years 10 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
118
click to vote
INFOSCALE
2009
ACM
15 years 9 months ago
2009
ACM
Address Fragmentation plays a key role in the exponential growth of DFZ routing table, known as the scalability problem of current Internet. In this paper, we measure the severity ...
142
click to vote
SIGECOM
2009
ACM
15 years 9 months ago
2009
ACM
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...