Sciweavers

3433 search results - page 50 / 687
» Heuristics for a bidding problem
Sort
View
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 2 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
CCGRID
2009
IEEE
13 years 8 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
ANOR
2008
106views more  ANOR 2008»
13 years 7 months ago
Application of multi-dimensional procurement auction in single-period inventory models
Procurement is one of the major activities in the Manufacturing Resource Planning (MRP II), which is closely coupled with inventory management. Any improvement in this area will h...
Pooya Farahvash, Tayfur Altiok
IJNSEC
2011
110views more  IJNSEC 2011»
13 years 2 months ago
An Anonymous Auction Protocol Based on GDH Assumption
The popularization and conveniences of Internet have changed traditional auction transactions into electronic auction via Internet. In 2006, Chang and Chang proposed an anonymous ...
Fuw-Yi Yang, Cai-Ming Liao
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...