3433 search results - page 189 / 687 » Heuristics for a bidding problem |
160
click to vote
SIGECOM
2004
ACM
16 years 19 hour ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
174
click to vote
HYBRID
2010
Springer
16 years 1 months ago
2010
Springer
Mixture-of-Experts (MoE) systems solve intricate problems by combining results generated independently by multiple computational models (the “experts”). Given an instance of a...
177
click to vote
FPL
1997
Springer
15 years 10 months ago
1997
Springer
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of...
155
click to vote
WSC
1998
15 years 8 months ago
1998
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...