10988 search results - page 1937 / 2198 » Algorithmic Folding Complexity |
135
click to vote
AAAI
2000
15 years 5 months ago
2000
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
132
click to vote
AAAI
2000
15 years 5 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
130
click to vote
AAAI
1998
15 years 5 months ago
1998
A central problem in learning in complex environmentsis balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of explora...
128
click to vote
BMVC
1998
15 years 5 months ago
1998
In the paper we present the Progressive Probabilistic Hough Transform (PPHT). Unlike the Probabilistic Hough Transform 4] where Standard Hough Transform is performed on a pre-sele...
140
click to vote
UAI
2003
15 years 5 months ago
2003
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...