1940 search results - page 214 / 388 » Search with Synonyms: Problems and Solutions |
185
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
154
click to vote
IPPS
2005
IEEE
16 years 5 days ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
195
click to vote
ICAI
2003
15 years 8 months ago
2003
Many real-world search and optimization problems naturally involve constraint handling. Recently, quite a few heuristic methods were proposed to solve the nonlinear constrained op...
168
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
174
click to vote
IAT
2006
IEEE
16 years 19 days ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...