2109 search results - page 204 / 422 » Solving Necklace Constraint Problems |
170
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
177
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
138
click to vote
IJSN
2006
15 years 6 months ago
2006
: WorkFlow Management Systems (WFMS) coordinate and streamline business processes. Acquiring workflow authorisations and managing workflow authorisation constraints is achallenging...
183
click to vote
INFOCOM
1998
IEEE
15 years 10 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
172
click to vote
CSCLP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...