5316 search results - page 211 / 1064 » Which Search Problems Are Random |
170
click to vote
TVCG
2011
14 years 11 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
117
click to vote
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
158
click to vote
AAAI
2000
15 years 5 months ago
2000
We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory m...
125
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
136
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...