1344 search results - page 193 / 269 » Problem Solving with Adaptive Feedback |
105
click to vote
ERCIMDL
2000
Springer
15 years 2 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
AAAI
2008
15 years 1 months ago
2008
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
111
click to vote
FPL
2008
Springer
15 years 24 days ago
2008
Springer
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increa...
ALENEX
2007
15 years 21 days ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
WOB
2003
15 years 18 days ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...