620 search results - page 32 / 124 » Towards Optimal Bayesian Algorithmic Mechanism Design |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
MICCAI
2009
Springer
14 years 3 days ago
2009
Springer
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an eï¬...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Trading rules are widely used by practitioners as an effective means to mechanize aspects of their reasoning about stock price trends. However, due to the simplicity of these rule...