Sciweavers

628 search results - page 46 / 126
» Designing the perfect auction
Sort
View

Lab
652views
15 years 9 months ago
Electronic Enterprises Laboratory
Our research is motivated by a strong conviction that business processes in electronic enterprises can be designed to deliver high levels of performance through the use of mathemat...
FPL
2003
Springer
76views Hardware» more  FPL 2003»
14 years 3 months ago
Quark Routing
With inherent problem complexity, ever increasing instance size and ever decreasing layout area, there is need in physical design for improved heuristics and algorithms. In this in...
Sean T. McCulloch, James P. Cohoon
WINE
2009
Springer
194views Economy» more  WINE 2009»
14 years 4 months ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi
ACNS
2008
Springer
121views Cryptology» more  ACNS 2008»
14 years 4 months ago
Anonymity in Transferable E-cash
Regular cash systems provide both the anonymity of users and the transferability of coins. In this paper, we study the anonymity properties of transferable e-cash. We define two n...
Sébastien Canard, Aline Gouget
CORR
2007
Springer
95views Education» more  CORR 2007»
13 years 10 months ago
Rateless Coding for Gaussian Channels
— A rateless code—i.e., a rate-compatible family of codes—has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect fa...
Uri Erez, Mitchell D. Trott, Gregory W. Wornell