559 search results - page 79 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
KI
2009
Springer
14 years 3 months ago
2009
Springer
Today’s complex production systems allow to simultaneously build different products following individual production plans. Such plans may fail due to component faults or unfores...
EOR
2007
13 years 8 months ago
2007
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
ICRA
2009
IEEE
14 years 3 months ago
2009
IEEE
— Separating sparse flow provides fast and robust stereo visual odometry that deals with nearly degenerate situations that often arise in practical applications. We make use of ...
WG
2005
Springer
14 years 2 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
CP
2006
Springer
14 years 15 days ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...