209 search results - page 9 / 42 » Decomposable Constraints |
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
MSOM
2008
13 years 7 months ago
2008
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
ICC
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper the interference channel is extended by additional relay nodes in order to investigate the influence of interference on the design and performance of relaying protoco...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We present a new approach to 3D scene modeling based on geometric constraints. Contrary to the existing methods, we can quickly obtain 3D scene models that respect the given const...
ACMICEC
2005
ACM
14 years 1 months ago
2005
ACM
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+ K(D) is introduced. It cannot only be able to represent knowledge a...