8647 search results - page 649 / 1730 » The Container Selection Problem |
221
click to vote
WAOA
2005
Springer
16 years 20 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
223
click to vote
ICTAI
2002
IEEE
16 years 4 days ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
168
click to vote
CCCG
1996
15 years 8 months ago
1996
In computational metrology one needs to compute whether an object satis es speci cations of shape within an acceptable tolerance. To this end positions on the object are measured,...
181
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...
194
click to vote
CVPR
2006
IEEE
16 years 9 months ago
2006
IEEE
Suppose a set of images contains frequent occurrences of objects from an unknown category. This paper is aimed at simultaneously solving the following related problems: (1) unsupe...