13376 search results - page 255 / 2676 » Problem Solving with |
115
Voted
APPT
2005
Springer
15 years 9 months ago
2005
Springer
By reasonably allocating a cooperative problem which need multiple solvers cope with together, the problem could be performed more effectively and efficiently. A problem could be d...
124
Voted
AAAI
1990
15 years 4 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
140
Voted
AMAI
2006
Springer
15 years 3 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
120
Voted
BMVC
1997
15 years 5 months ago
1997
A new geometrical approach in solving the shape from shading problem of Lambertian model is discussed. It is shown that this problem is bound by two local constraints through the ...
132
Voted
SIAMSC
2011
14 years 10 months ago
2011
We propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galerkin type using conforming finite elements...