8496 search results - page 53 / 1700 » Problem Solving and Complex Systems |
SAGA
2009
Springer
14 years 2 months ago
2009
Springer
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
JASIS
1998
13 years 7 months ago
1998
This article develops a theoretical framework of distributed representations to explore the representational properties in group problem solving. The basic principle of distribute...
SIGAL
1990
13 years 12 months ago
1990
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
SSWMC
2004
13 years 9 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...