3433 search results - page 167 / 687 » Heuristics for a bidding problem |
195
click to vote
WINE
2005
Springer
16 years 1 days ago
2005
Springer
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related...
184
click to vote
AAAI
1998
15 years 8 months ago
1998
Automatedreasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have manyshortcomings. The...
162
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
The core task of sponsored search is to retrieve relevant ads for the user’s query. Ads can be retrieved either by exact match, when their bid term is identical to the query, or...
185
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We present a practical, market-based solution to the resource provisioning problem in a set of heterogeneous resource clusters. We focus on provisioning rather than immediate sc...
156
click to vote
IDA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...