19320 search results - page 424 / 3864 » On the complexity of computing determinants |
196
click to vote
WECWIS
2005
IEEE
16 years 14 days ago
2005
IEEE
Proxy bidding has been proposed for combinatorial auctions as a means to speed up the auctions, to simplify the user interface, and to limit strategic behavior. The only previousl...
169
click to vote
EURONGI
2005
Springer
16 years 12 days ago
2005
Springer
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
173
click to vote
ASIACRYPT
2004
Springer
16 years 8 days ago
2004
Springer
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
180
click to vote
ACMICEC
2003
ACM
16 years 4 days ago
2003
ACM
Combinatorial auctions are difficult to analyze in part because of the vast number of potential strategies available to the bidders. Proxy bidding interfaces limit the users’ s...
173
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
: In VLSI circuits with deep sub-micron, the parasitic capacitance from interconnect is a very important factor determining circuit performances such as power and time-delay. The B...