3433 search results - page 63 / 687 » Heuristics for a bidding problem |
PPSN
2000
Springer
13 years 11 months ago
2000
Springer
Domain knowledge is essential for successful problem solving and optimization. This paper introduces a framework in which a form of automatic domain knowledge extraction can be im...
AAAI
2010
13 years 9 months ago
2010
In many auctions, agents bid more aggressively than selfinterest would prescribe. This can be explained by spite, where the agent's utility not only increases in the agent�...
ALENEX
2007
13 years 9 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
AAAI
2004
13 years 9 months ago
2004
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...