Sciweavers

3433 search results - page 12 / 687
» Heuristics for a bidding problem
Sort
View
HEURISTICS
2010
13 years 4 months ago
Alternating control tree search for knapsack/covering problems
Lars Magnus Hvattum, Halvard Arntzen, Arne L&oslas...
JAMDS
2002
155views more  JAMDS 2002»
13 years 7 months ago
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
Zvi Drezner
COCOON
2008
Springer
13 years 9 months ago
Spectrum Bidding in Wireless Networks and Related
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
Xiang-Yang Li, Ping Xu, ShaoJie Tang, Xiaowen Chu
ATAL
2003
Springer
14 years 24 days ago
Scheduling tasks with precedence constraints to solicit desirable bid combinations
In our previous research we suggested an approach to maximizing agents preferences over schedules of multiple tasks with temporal and precedence constraints. The proposed approach...
Alexander Babanov, John Collins, Maria L. Gini
WSC
2008
13 years 10 months ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese