2913 search results - page 157 / 583 » How Much to Copy |
ORL
2006
13 years 10 months ago
2006
This paper is concerned with information revelation in single-item auctions. We compute how much data needs to be transmitted in three strategically equivalent auctions--the Vickr...
RSA
2008
13 years 10 months ago
2008
: In this article, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (local...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A problem posed by Freund is how to efficiently track a small pool of experts out of a much larger set. This problem was solved when Bousquet and Warmuth introduced their mixing p...
SIGCSE
2009
ACM
14 years 11 months ago
2009
ACM
How suitable is a Python-based CS1 course as preparation for a C++-based CS2 course? After fifteen years of using C++ for both CS1 and CS2, the Computer Science Department at Mich...
CP
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. Constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. The solver state is modified during propagation. But...