784 search results - page 34 / 157 » Relaxing the Value Restriction |
AI
2006
Springer
13 years 10 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
ICCV
2007
IEEE
15 years 1 days ago
2007
IEEE
We present a practical, stratified autocalibration algorithm with theoretical guarantees of global optimality. Given a projective reconstruction, the first stage of the algorithm ...
SARA
2009
Springer
14 years 4 months ago
2009
Springer
Perfect recall is the common and natural assumption that an agent never forgets. As a consequence, the agent can always condition its choice of action on any prior observations. I...
WINE
2005
Springer
14 years 3 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
APN
2003
Springer
14 years 3 months ago
2003
Springer
Fluidification is a common relaxation technique used to deal in a more friendly way with large discrete event dynamic systems. In Petri nets, fluidification leads to continuous ...