Sciweavers

698 search results - page 59 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
NIPS
2004
13 years 10 months ago
Approximately Efficient Online Mechanism Design
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
David C. Parkes, Satinder P. Singh, Dimah Yanovsky
AIPS
2010
13 years 11 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
IVC
2007
114views more  IVC 2007»
13 years 9 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
14 years 2 months ago
The Online Target Date Assignment Problem
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...
SETN
2004
Springer
14 years 2 months ago
Automated Medical Image Registration Using the Simulated Annealing Algorithm
This paper presents a robust, automated registration algorithm, which may be applied to several types of medical images, including CTs, MRIs, Xrays, Ultrasounds and dermatological ...
Ilias Maglogiannis, Elias P. Zafiropoulos