3433 search results - page 214 / 687 » Heuristics for a bidding problem |
183
click to vote
PDP
2010
IEEE
15 years 12 months ago
2010
IEEE
Abstract—Load balancing algorithms are an essential component of parallel computing reducing the response time of applications. Frequently, balancing algorithms have a centralize...
179
click to vote
ATAL
2003
Springer
15 years 12 months ago
2003
Springer
Recommender systems have been widely advocated as a way of coping with the problem of information overload for knowledge workers. Given this, multiple recommendation methods have ...
146
click to vote
AGENTS
1998
Springer
15 years 11 months ago
1998
Springer
We present a framework for de ning trading scenarios based on sh market auctions. In these scenarios, agents of arbitrary complexity can participate in electronic auctions under ...
137
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Most research on auctions assumes that potential bidders have private information about their willingness to pay for the item being auctioned, and that they use this information s...
148
click to vote
WG
2000
Springer
15 years 10 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...