Sciweavers

3433 search results - page 19 / 687
» Heuristics for a bidding problem
Sort
View
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 7 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma
MOBIHOC
2009
ACM
14 years 8 months ago
Spectrum auction framework for access allocation in cognitive radio networks
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
Gaurav S. Kasbekar, Saswati Sarkar
AE
2007
Springer
14 years 1 months ago
Generating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...
Mohamed Bahy Bader-El-Den, Riccardo Poli
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
14 years 9 months ago
Toward Expressive and Scalable Sponsored Search Auctions
Internet search results are a growing and highly profitable advertising platform. Search providers auction advertising slots to advertisers on their search result pages. Due to the...
David J. Martin, Johannes Gehrke, Joseph Y. Halper...